Base | Representation |
---|---|
bin | 1001001001010100000100… |
… | …01000010111101101111101 |
3 | 2122012121120111201121101112 |
4 | 10210222002020113231331 |
5 | 10114000234322043003 |
6 | 110434544511051405 |
7 | 4143662532254624 |
oct | 444520210275575 |
9 | 78177514647345 |
10 | 20111220112253 |
11 | 6454136500586 |
12 | 2309832b10b65 |
13 | b2b6314c764a |
14 | 4d75614c86bb |
15 | 24d21413d3d8 |
hex | 124a82217b7d |
20111220112253 has 2 divisors, whose sum is σ = 20111220112254. Its totient is φ = 20111220112252.
The previous prime is 20111220112163. The next prime is 20111220112259. The reversal of 20111220112253 is 35221102211102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18899730253924 + 1211489858329 = 4347382^2 + 1100677^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20111220112253 is a prime.
It is a super-2 number, since 2×201112201122532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20111220112259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10055610056126 + 10055610056127.
It is an arithmetic number, because the mean of its divisors is an integer number (10055610056127).
Almost surely, 220111220112253 is an apocalyptic number.
It is an amenable number.
20111220112253 is a deficient number, since it is larger than the sum of its proper divisors (1).
20111220112253 is an equidigital number, since it uses as much as digits as its factorization.
20111220112253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 20111220112253 its reverse (35221102211102), we get a palindrome (55332322323355).
The spelling of 20111220112253 in words is "twenty trillion, one hundred eleven billion, two hundred twenty million, one hundred twelve thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •