Base | Representation |
---|---|
bin | 11001011111100101101111… |
… | …111111100101100100010111 |
3 | 112200222202110222022000220102 |
4 | 121133211233333211210113 |
5 | 104144001324022431012 |
6 | 1034244045200324315 |
7 | 32421355454603015 |
oct | 3137455777454427 |
9 | 480882428260812 |
10 | 112122000202007 |
11 | 327a8745110504 |
12 | 106a9bb301369b |
13 | 4a740a0238173 |
14 | 1d98a3b6458b5 |
15 | ce683d0982c2 |
hex | 65f96ffe5917 |
112122000202007 has 2 divisors, whose sum is σ = 112122000202008. Its totient is φ = 112122000202006.
The previous prime is 112122000201919. The next prime is 112122000202033. The reversal of 112122000202007 is 700202000221211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112122000202007 - 224 = 112121983424791 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112122000202007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112122000208007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56061000101003 + 56061000101004.
It is an arithmetic number, because the mean of its divisors is an integer number (56061000101004).
Almost surely, 2112122000202007 is an apocalyptic number.
112122000202007 is a deficient number, since it is larger than the sum of its proper divisors (1).
112122000202007 is an equidigital number, since it uses as much as digits as its factorization.
112122000202007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 112122000202007 its reverse (700202000221211), we get a palindrome (812324000423218).
The spelling of 112122000202007 in words is "one hundred twelve trillion, one hundred twenty-two billion, two hundred two thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •