Base | Representation |
---|---|
bin | 1001001001010101111001… |
… | …00010010110001001101111 |
3 | 2122012201002210120001211102 |
4 | 10210222330202112021233 |
5 | 10114004241200000421 |
6 | 110435230033313315 |
7 | 4144026031211552 |
oct | 444527442261157 |
9 | 78181083501742 |
10 | 20112200000111 |
11 | 645459963785a |
12 | 2309a6710583b |
13 | b2b75951234b |
14 | 4d76156bc699 |
15 | 24d27019a60b |
hex | 124abc89626f |
20112200000111 has 8 divisors (see below), whose sum is σ = 20114760193920. Its totient is φ = 20109639993048.
The previous prime is 20112200000107. The next prime is 20112200000117. The reversal of 20112200000111 is 11100000221102.
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 20112200000111 - 22 = 20112200000107 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20112200000092 and 20112200000101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112200000117) 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, 396610220 + ... + 396660926.
It is an arithmetic number, because the mean of its divisors is an integer number (2514345024240).
Almost surely, 220112200000111 is an apocalyptic number.
20112200000111 is a deficient number, since it is larger than the sum of its proper divisors (2560193809).
20112200000111 is a wasteful number, since it uses less digits than its factorization.
20112200000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 93373.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20112200000111 its reverse (11100000221102), we get a palindrome (31212200221213).
The spelling of 20112200000111 in words is "twenty trillion, one hundred twelve billion, two hundred million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •