Base | Representation |
---|---|
bin | 1001001001010101111001… |
… | …00010010110001001110101 |
3 | 2122012201002210120001211122 |
4 | 10210222330202112021311 |
5 | 10114004241200000432 |
6 | 110435230033313325 |
7 | 4144026031211561 |
oct | 444527442261165 |
9 | 78181083501748 |
10 | 20112200000117 |
11 | 6454599637865 |
12 | 2309a67105845 |
13 | b2b759512354 |
14 | 4d76156bc6a1 |
15 | 24d27019a612 |
hex | 124abc896275 |
20112200000117 has 2 divisors, whose sum is σ = 20112200000118. Its totient is φ = 20112200000116.
The previous prime is 20112200000107. The next prime is 20112200000219. The reversal of 20112200000117 is 71100000221102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11716340251396 + 8395859748721 = 3422914^2 + 2897561^2 .
It is a cyclic number.
It is not a de Polignac number, because 20112200000117 - 222 = 20112195805813 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20112200000095 and 20112200000104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20112200000107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056100000058 + 10056100000059.
It is an arithmetic number, because the mean of its divisors is an integer number (10056100000059).
Almost surely, 220112200000117 is an apocalyptic number.
It is an amenable number.
20112200000117 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112200000117 is an equidigital number, since it uses as much as digits as its factorization.
20112200000117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56, while the sum is 17.
Adding to 20112200000117 its reverse (71100000221102), we get a palindrome (91212200221219).
The spelling of 20112200000117 in words is "twenty trillion, one hundred twelve billion, two hundred million, one hundred seventeen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •