Base | Representation |
---|---|
bin | 1001100110101101001000… |
… | …10100011000101111000101 |
3 | 2202210011021112121021221102 |
4 | 10303112210110120233011 |
5 | 10232022013404031203 |
6 | 112530523205425445 |
7 | 4306643551221236 |
oct | 463264424305705 |
9 | 82704245537842 |
10 | 21121111002053 |
11 | 680345a597367 |
12 | 24514b540b285 |
13 | ba293499a2aa |
14 | 5303a53b108d |
15 | 26961ddad888 |
hex | 1335a4518bc5 |
21121111002053 has 2 divisors, whose sum is σ = 21121111002054. Its totient is φ = 21121111002052.
The previous prime is 21121111001971. The next prime is 21121111002083. The reversal of 21121111002053 is 35020011112112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18470199503809 + 2650911498244 = 4297697^2 + 1628162^2 .
It is a cyclic number.
It is not a de Polignac number, because 21121111002053 - 28 = 21121111001797 is a prime.
It is a super-2 number, since 2×211211110020532 (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 (21121111002083) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10560555501026 + 10560555501027.
It is an arithmetic number, because the mean of its divisors is an integer number (10560555501027).
Almost surely, 221121111002053 is an apocalyptic number.
It is an amenable number.
21121111002053 is a deficient number, since it is larger than the sum of its proper divisors (1).
21121111002053 is an equidigital number, since it uses as much as digits as its factorization.
21121111002053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 20.
Adding to 21121111002053 its reverse (35020011112112), we get a palindrome (56141122114165).
The spelling of 21121111002053 in words is "twenty-one trillion, one hundred twenty-one billion, one hundred eleven million, two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •