Base | Representation |
---|---|
bin | 1001000110101100011010… |
… | …01111000011011000001111 |
3 | 2121220000020200202211200012 |
4 | 10203112031033003120033 |
5 | 10111011420244200421 |
6 | 110325341243023435 |
7 | 4134325204631225 |
oct | 443261517033017 |
9 | 77800220684605 |
10 | 20021212100111 |
11 | 6419a48307892 |
12 | 22b42b350ab7b |
13 | b22cb8b2b571 |
14 | 4d3063502b15 |
15 | 24abe722c95b |
hex | 12358d3c360f |
20021212100111 has 8 divisors (see below), whose sum is σ = 21086470224000. Its totient is φ = 18957104988120.
The previous prime is 20021212100107. The next prime is 20021212100179. The reversal of 20021212100111 is 11100121212002.
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 20021212100111 - 22 = 20021212100107 is a prime.
It is a super-2 number, since 2×200212121001112 (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 (20021212100101) 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, 287717261 + ... + 287786838.
It is an arithmetic number, because the mean of its divisors is an integer number (2635808778000).
Almost surely, 220021212100111 is an apocalyptic number.
20021212100111 is a deficient number, since it is larger than the sum of its proper divisors (1065258123889).
20021212100111 is a wasteful number, since it uses less digits than its factorization.
20021212100111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 575505949.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20021212100111 its reverse (11100121212002), we get a palindrome (31121333312113).
The spelling of 20021212100111 in words is "twenty trillion, twenty-one billion, two hundred twelve million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •