Base | Representation |
---|---|
bin | 11001011111010010011001… |
… | …100001011101101101111111 |
3 | 112200220202211220122200222222 |
4 | 121133102121201131231333 |
5 | 104143131300330042002 |
6 | 1034230331313555555 |
7 | 32420021534005343 |
oct | 3137223141355577 |
9 | 480822756580888 |
10 | 112101222112127 |
11 | 3279a952455aa6 |
12 | 106a5b74575bbb |
13 | 4a7213b5ac321 |
14 | 1d97a29c99623 |
15 | ce6023d821a2 |
hex | 65f49985db7f |
112101222112127 has 2 divisors, whose sum is σ = 112101222112128. Its totient is φ = 112101222112126.
The previous prime is 112101222112097. The next prime is 112101222112163. The reversal of 112101222112127 is 721211222101211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112101222112127 - 214 = 112101222095743 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112101222112096 and 112101222112105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112101222112427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56050611056063 + 56050611056064.
It is an arithmetic number, because the mean of its divisors is an integer number (56050611056064).
Almost surely, 2112101222112127 is an apocalyptic number.
112101222112127 is a deficient number, since it is larger than the sum of its proper divisors (1).
112101222112127 is an equidigital number, since it uses as much as digits as its factorization.
112101222112127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 448, while the sum is 26.
Adding to 112101222112127 its reverse (721211222101211), we get a palindrome (833312444213338).
The spelling of 112101222112127 in words is "one hundred twelve trillion, one hundred one billion, two hundred twenty-two million, one hundred twelve thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •