Base | Representation |
---|---|
bin | 11101000111110001000… |
… | …000000100111101010011 |
3 | 21002022110021201210002021 |
4 | 131013301000010331103 |
5 | 230241430444401003 |
6 | 4131201240032311 |
7 | 264403451605261 |
oct | 35076100047523 |
9 | 7068407653067 |
10 | 2001203122003 |
11 | 701783a9a198 |
12 | 283a1aa62697 |
13 | 1169358ac897 |
14 | 6cc04593431 |
15 | 370c89332bd |
hex | 1d1f1004f53 |
2001203122003 has 8 divisors (see below), whose sum is σ = 2070813261600. Its totient is φ = 1931633191488.
The previous prime is 2001203121991. The next prime is 2001203122007. The reversal of 2001203122003 is 3002213021002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2001203122003 - 217 = 2001202990931 is a prime.
It is a super-3 number, since 3×20012031220033 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2001203122007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9950983 + ... + 10150096.
It is an arithmetic number, because the mean of its divisors is an integer number (258851657700).
Almost surely, 22001203122003 is an apocalyptic number.
2001203122003 is a deficient number, since it is larger than the sum of its proper divisors (69610139597).
2001203122003 is a wasteful number, since it uses less digits than its factorization.
2001203122003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20104541.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 2001203122003 its reverse (3002213021002), we get a palindrome (5003416143005).
The spelling of 2001203122003 in words is "two trillion, one billion, two hundred three million, one hundred twenty-two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •