Base | Representation |
---|---|
bin | 11001100000101111010101… |
… | …011110000110001100101111 |
3 | 112201021022102110010211122211 |
4 | 121200233111132012030233 |
5 | 104201300133100011002 |
6 | 1034344233335551251 |
7 | 32430153451001203 |
oct | 3140572536061457 |
9 | 481238373124584 |
10 | 112201012110127 |
11 | 32829200297526 |
12 | 10701383b2b527 |
13 | 4a7b682742015 |
14 | 1d9c7b5092b03 |
15 | ce8914938dd7 |
hex | 660bd578632f |
112201012110127 has 2 divisors, whose sum is σ = 112201012110128. Its totient is φ = 112201012110126.
The previous prime is 112201012110097. The next prime is 112201012110133. The reversal of 112201012110127 is 721011210102211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112201012110127 - 243 = 103404919087919 is a prime.
It is a super-2 number, since 2×1122010121101272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112201012110098 and 112201012110107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112201012110137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56100506055063 + 56100506055064.
It is an arithmetic number, because the mean of its divisors is an integer number (56100506055064).
Almost surely, 2112201012110127 is an apocalyptic number.
112201012110127 is a deficient number, since it is larger than the sum of its proper divisors (1).
112201012110127 is an equidigital number, since it uses as much as digits as its factorization.
112201012110127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 22.
Adding to 112201012110127 its reverse (721011210102211), we get a palindrome (833212222212338).
The spelling of 112201012110127 in words is "one hundred twelve trillion, two hundred one billion, twelve million, one hundred ten thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •