Base | Representation |
---|---|
bin | 1001000110000111001010… |
… | …01001011111110001110101 |
3 | 2121211002121212102202022212 |
4 | 10203003211021133301311 |
5 | 10110144440310431401 |
6 | 110312232515503205 |
7 | 4133016453410534 |
oct | 443034511376165 |
9 | 77732555382285 |
10 | 20001212202101 |
11 | 6411514948459 |
12 | 22b04515b7b05 |
13 | b2114c48b1a0 |
14 | 4d20c724631b |
15 | 24a4264d1dbb |
hex | 1230e525fc75 |
20001212202101 has 8 divisors (see below), whose sum is σ = 21540702722784. Its totient is φ = 18461855358000.
The previous prime is 20001212202091. The next prime is 20001212202109. The reversal of 20001212202101 is 10120221210002.
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 20001212202101 - 222 = 20001208007797 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001212202109) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 33108275 + ... + 33706976.
It is an arithmetic number, because the mean of its divisors is an integer number (2692587840348).
Almost surely, 220001212202101 is an apocalyptic number.
It is an amenable number.
20001212202101 is a deficient number, since it is larger than the sum of its proper divisors (1539490520683).
20001212202101 is a wasteful number, since it uses less digits than its factorization.
20001212202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66838291.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 20001212202101 its reverse (10120221210002), we get a palindrome (30121433412103).
The spelling of 20001212202101 in words is "twenty trillion, one billion, two hundred twelve million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •