Base | Representation |
---|---|
bin | 1001001001010101101101… |
… | …01100111011101100000001 |
3 | 2122012200211222100211120212 |
4 | 10210222312230323230001 |
5 | 10114004041120041001 |
6 | 110435212215243505 |
7 | 4144023432163514 |
oct | 444526654735401 |
9 | 78180758324525 |
10 | 20112102112001 |
11 | 6454549358a99 |
12 | 2309a3a379595 |
13 | b2b74215aba3 |
14 | 4d76066bad7b |
15 | 24d2667b17bb |
hex | 124ab6b3bb01 |
20112102112001 has 8 divisors (see below), whose sum is σ = 20397479465664. Its totient is φ = 19826783322640.
The previous prime is 20112102111971. The next prime is 20112102112009. The reversal of 20112102112001 is 10021120121102.
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 20112102112001 - 218 = 20112101849857 is a prime.
It is a super-3 number, since 3×201121021120013 (a number of 41 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20112102112009) 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, 13949135 + ... + 15323268.
It is an arithmetic number, because the mean of its divisors is an integer number (2549684933208).
Almost surely, 220112102112001 is an apocalyptic number.
It is an amenable number.
20112102112001 is a deficient number, since it is larger than the sum of its proper divisors (285377353663).
20112102112001 is an equidigital number, since it uses as much as digits as its factorization.
20112102112001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29282151.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20112102112001 its reverse (10021120121102), we get a palindrome (30133222233103).
The spelling of 20112102112001 in words is "twenty trillion, one hundred twelve billion, one hundred two million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •