Base | Representation |
---|---|
bin | 1001000110000110111111… |
… | …01101111110000011100000 |
3 | 2121211002101112000021201222 |
4 | 10203003133231332003200 |
5 | 10110144244000200000 |
6 | 110312215503114212 |
7 | 4133014266144665 |
oct | 443033755760340 |
9 | 77732345007658 |
10 | 20001121100000 |
11 | 6411478484067 |
12 | 22b0426ba2968 |
13 | b21136641711 |
14 | 4d20b90cda6c |
15 | 24a41d4d8a85 |
hex | 1230dfb7e0e0 |
20001121100000 has 72 divisors (see below), whose sum is σ = 49218359026536. Its totient is φ = 8000448400000.
The previous prime is 20001121099997. The next prime is 20001121100021. The reversal of 20001121100000 is 112110002.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 99905606 + ... + 100105605.
It is an arithmetic number, because the mean of its divisors is an integer number (683588319813).
Almost surely, 220001121100000 is an apocalyptic number.
20001121100000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20001121100000 is an abundant number, since it is smaller than the sum of its proper divisors (29217237926536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001121100000 is an frugal number, since it uses more digits than its factorization.
20001121100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200011246 (or 200011218 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 20001121100000 its reverse (112110002), we get a palindrome (20001233210002).
The spelling of 20001121100000 in words is "twenty trillion, one billion, one hundred twenty-one million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •