Base | Representation |
---|---|
bin | 1011000001100110010110… |
… | …0101110001111100110101 |
3 | 1120220212021010202001220212 |
4 | 2300121211211301330311 |
5 | 3042102031120041203 |
6 | 41440452234035205 |
7 | 2360535663566333 |
oct | 260314545617465 |
9 | 46825233661825 |
10 | 12122102112053 |
11 | 3953a5568a90a |
12 | 1439417578b05 |
13 | 69c15625422b |
14 | 2dc9da1a0b53 |
15 | 1604cc7091d8 |
hex | b0665971f35 |
12122102112053 has 2 divisors, whose sum is σ = 12122102112054. Its totient is φ = 12122102112052.
The previous prime is 12122102112047. The next prime is 12122102112121. The reversal of 12122102112053 is 35021120122121.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11552126940964 + 569975171089 = 3398842^2 + 754967^2 .
It is a cyclic number.
It is not a de Polignac number, because 12122102112053 - 220 = 12122101063477 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12122102102053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6061051056026 + 6061051056027.
It is an arithmetic number, because the mean of its divisors is an integer number (6061051056027).
Almost surely, 212122102112053 is an apocalyptic number.
It is an amenable number.
12122102112053 is a deficient number, since it is larger than the sum of its proper divisors (1).
12122102112053 is an equidigital number, since it uses as much as digits as its factorization.
12122102112053 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 12122102112053 its reverse (35021120122121), we get a palindrome (47143222234174).
The spelling of 12122102112053 in words is "twelve trillion, one hundred twenty-two billion, one hundred two million, one hundred twelve thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •