Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …00001011111000011101000 |
3 | 2121211002121201111001112001 |
4 | 10203003211001133003220 |
5 | 10110144434241230432 |
6 | 110312232402500344 |
7 | 4133016426513010 |
oct | 443034501370350 |
9 | 77732551431461 |
10 | 20001210101992 |
11 | 6411513743629 |
12 | 22b04509646b4 |
13 | b2114bc04312 |
14 | 4d20c6c5ac40 |
15 | 24a4262199e7 |
hex | 1230e505f0e8 |
20001210101992 has 64 divisors (see below), whose sum is σ = 43075204773120. Its totient is φ = 8528957918208.
The previous prime is 20001210101959. The next prime is 20001210102007. The reversal of 20001210101992 is 29910101210002.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 20001210101992.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 8102538 + ... + 10278790.
It is an arithmetic number, because the mean of its divisors is an integer number (673050074580).
Almost surely, 220001210101992 is an apocalyptic number.
It is an amenable number.
20001210101992 is an abundant number, since it is smaller than the sum of its proper divisors (23073994671128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20001210101992 is a wasteful number, since it uses less digits than its factorization.
20001210101992 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2177090 (or 2177086 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 28.
Adding to 20001210101992 its reverse (29910101210002), we get a palindrome (49911311311994).
The spelling of 20001210101992 in words is "twenty trillion, one billion, two hundred ten million, one hundred one thousand, nine hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •