Base | Representation |
---|---|
bin | 1001000110000111001001… |
… | …00011000000011001101111 |
3 | 2121211002121011110010110112 |
4 | 10203003210203000121233 |
5 | 10110144430220041421 |
6 | 110312231515330235 |
7 | 4133016301554623 |
oct | 443034443003157 |
9 | 77732534403415 |
10 | 20001202112111 |
11 | 641150a186720 |
12 | 22b044a15097b |
13 | b2114a36768c |
14 | 4d20c5b7b183 |
15 | 24a42568c45b |
hex | 1230e48c066f |
20001202112111 has 8 divisors (see below), whose sum is σ = 22189315132800. Its totient is φ = 17874726078040.
The previous prime is 20001202112107. The next prime is 20001202112147. The reversal of 20001202112111 is 11121120210002.
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 20001202112111 - 22 = 20001202112107 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 (20001202112911) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 15409245971 + ... + 15409247268.
It is an arithmetic number, because the mean of its divisors is an integer number (2773664391600).
Almost surely, 220001202112111 is an apocalyptic number.
20001202112111 is a deficient number, since it is larger than the sum of its proper divisors (2188113020689).
20001202112111 is a wasteful number, since it uses less digits than its factorization.
20001202112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30818493309.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20001202112111 its reverse (11121120210002), we get a palindrome (31122322322113).
The spelling of 20001202112111 in words is "twenty trillion, one billion, two hundred two million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •