46001

46,001 (forty-six thousand one) is an odd five-digits composite number following 46000 and preceding 46002. In scientific notation, it is written as 4.6001 × 104. The sum of its digits is 11. It has a total of 2 prime factors and 4 positive divisors. There are 45,552 positive integers (up to 46001) that are relatively prime to 46001.

Basic properties

• Is Prime? No
• Number parity Odd
• Number length 5
• Sum of Digits 11
• Digital Root 2

Name

Short name 46 thousand 1 forty-six thousand one

Notation

Scientific notation 4.6001 × 104 46.001 × 103

Prime Factorization of 46001

Prime Factorization 157 × 293

Composite number
Distinct Factors Total Factors Radical ω(n) 2 Total number of distinct prime factors Ω(n) 2 Total number of prime factors rad(n) 46001 Product of the distinct prime numbers λ(n) 1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 1 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 46,001 is 157 × 293. Since it has a total of 2 prime factors, 46,001 is a composite number.

Divisors of 46001

1, 157, 293, 46001

4 divisors

 Even divisors 0 4 4 0
Total Divisors Sum of Divisors Aliquot Sum τ(n) 4 Total number of the positive divisors of n σ(n) 46452 Sum of all the positive divisors of n s(n) 451 Sum of the proper positive divisors of n A(n) 11613 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 214.478 Returns the nth root of the product of n divisors H(n) 3.96116 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 46,001 can be divided by 4 positive divisors (out of which 0 are even, and 4 are odd). The sum of these divisors (counting 46,001) is 46,452, the average is 11,613.

Other Arithmetic Functions (n = 46001)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 45552 Total number of positive integers not greater than n that are coprime to n λ(n) 11388 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 4761 Total number of primes less than or equal to n r2(n) 16 The number of ways n can be represented as the sum of 2 squares

There are 45,552 positive integers (less than 46,001) that are coprime with 46,001. And there are approximately 4,761 prime numbers less than or equal to 46,001.

Divisibility of 46001

 m n mod m 2 3 4 5 6 7 8 9 1 2 1 1 5 4 1 2

46,001 is not divisible by any number less than or equal to 9.

Classification of 46001

• Arithmetic
• Semiprime
• Deficient

• Polite

• Square Free

Other numbers

• LucasCarmichael

Base conversion (46001)

Base System Value
2 Binary 1011001110110001
3 Ternary 2100002202
4 Quaternary 23032301
5 Quinary 2433001
6 Senary 552545
8 Octal 131661
10 Decimal 46001
12 Duodecimal 22755
20 Vigesimal 5f01
36 Base36 zht

Basic calculations (n = 46001)

Multiplication

n×i
 n×2 92002 138003 184004 230005

Division

ni
 n⁄2 23000.5 15333.7 11500.2 9200.2

Exponentiation

ni
 n2 2116092001 97342348138001 4477845356696184001 205985364253381160230001

Nth Root

i√n
 2√n 214.478 35.8307 14.6451 8.56157

46001 as geometric shapes

Circle

 Diameter 92002 289033 6.6479e+09

Sphere

 Volume 4.07747e+14 2.65916e+10 289033

Square

Length = n
 Perimeter 184004 2.11609e+09 65055.2

Cube

Length = n
 Surface area 1.26966e+10 9.73423e+13 79676.1

Equilateral Triangle

Length = n
 Perimeter 138003 9.16295e+08 39838

Triangular Pyramid

Length = n
 Surface area 3.66518e+09 1.14719e+13 37559.7

Cryptographic Hash Functions

md5 6b34a8bba1dd1aaa9ac3fc1235f21f39 d142ae82e68dd0c467b24513722e1b8754299ee8 22a869bd8804784dcb0cbcad5c397c6fa97dd743ff03417275ba4e57d64aa0ca 1c7882f11e3eeac0f7aecc5b96e1ea68f1414d18f2f11781cf330926a2de634bc063af16325162bfcd981b228f07f39c8588a372d5c33528bef4f960ede38724 eafb2e82dd1693baba24b75f72b294134623f7c9
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://metanumbers.com/46001", "fetch_time": 1610774916000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2021-04/segments/1610703500028.5/warc/CC-MAIN-20210116044418-20210116074418-00168.warc.gz", "warc_record_offset": 462751121, "warc_record_length": 7441, "token_count": 1416, "char_count": 4033, "score": 3.734375, "int_score": 4, "crawl": "CC-MAIN-2021-04", "snapshot_type": "longest", "language": "en", "language_score": 0.8176204562187195, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00056-of-00064.parquet"}