Base | Representation |
---|---|
bin | 1001000110000110111111… |
… | …01101100101101010100111 |
3 | 2121211002101111211012201002 |
4 | 10203003133231211222213 |
5 | 10110144243434000403 |
6 | 110312215501023515 |
7 | 4133014265250515 |
oct | 443033755455247 |
9 | 77732344735632 |
10 | 20001121000103 |
11 | 6411478416001 |
12 | 22b0426b54b9b |
13 | b211366080c9 |
14 | 4d20b90a54b5 |
15 | 24a41d4b9188 |
hex | 1230dfb65aa7 |
20001121000103 has 8 divisors (see below), whose sum is σ = 20097164656128. Its totient is φ = 19905134063544.
The previous prime is 20001121000057. The next prime is 20001121000129. The reversal of 20001121000103 is 30100012110002.
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 20001121000103 - 236 = 19932401523367 is a prime.
It is a super-2 number, since 2×200011210001032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001121000303) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13472825 + ... + 14883522.
It is an arithmetic number, because the mean of its divisors is an integer number (2512145582016).
Almost surely, 220001121000103 is an apocalyptic number.
20001121000103 is a deficient number, since it is larger than the sum of its proper divisors (96043656025).
20001121000103 is a wasteful number, since it uses less digits than its factorization.
20001121000103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28359733.
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 20001121000103 its reverse (30100012110002), we get a palindrome (50101133110105).
The spelling of 20001121000103 in words is "twenty trillion, one billion, one hundred twenty-one million, one hundred three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •