Base | Representation |
---|---|
bin | 11001011101110110000000… |
… | …101111100010001010001001 |
3 | 112200120021210111101002011001 |
4 | 121131312000233202022021 |
5 | 104140020120130401441 |
6 | 1034113004005535001 |
7 | 32406610343004445 |
oct | 3135660057421211 |
9 | 480507714332131 |
10 | 112002022122121 |
11 | 3276187766828a |
12 | 1068a8aa714461 |
13 | 4a6598c7571a1 |
14 | 1d92cd91a7825 |
15 | ce3669ec2731 |
hex | 65dd80be2289 |
112002022122121 has 2 divisors, whose sum is σ = 112002022122122. Its totient is φ = 112002022122120.
The previous prime is 112002022122119. The next prime is 112002022122233. The reversal of 112002022122121 is 121221220200211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 88761572024896 + 23240450097225 = 9421336^2 + 4820835^2 .
It is a cyclic number.
It is not a de Polignac number, because 112002022122121 - 21 = 112002022122119 is a prime.
Together with 112002022122119, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (112002022122521) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56001011061060 + 56001011061061.
It is an arithmetic number, because the mean of its divisors is an integer number (56001011061061).
Almost surely, 2112002022122121 is an apocalyptic number.
It is an amenable number.
112002022122121 is a deficient number, since it is larger than the sum of its proper divisors (1).
112002022122121 is an equidigital number, since it uses as much as digits as its factorization.
112002022122121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 112002022122121 its reverse (121221220200211), we get a palindrome (233223242322332).
The spelling of 112002022122121 in words is "one hundred twelve trillion, two billion, twenty-two million, one hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •