Base | Representation |
---|---|
bin | 11001100000101111010101… |
… | …011110000110001100111001 |
3 | 112201021022102110010211200012 |
4 | 121200233111132012030321 |
5 | 104201300133100011022 |
6 | 1034344233335551305 |
7 | 32430153451001216 |
oct | 3140572536061471 |
9 | 481238373124605 |
10 | 112201012110137 |
11 | 32829200297535 |
12 | 10701383b2b535 |
13 | 4a7b682742022 |
14 | 1d9c7b5092b0d |
15 | ce8914938de2 |
hex | 660bd5786339 |
112201012110137 has 2 divisors, whose sum is σ = 112201012110138. Its totient is φ = 112201012110136.
The previous prime is 112201012110133. The next prime is 112201012110191. The reversal of 112201012110137 is 731011210102211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 111844246014736 + 356766095401 = 10575644^2 + 597299^2 .
It is an emirp because it is prime and its reverse (731011210102211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112201012110137 - 22 = 112201012110133 is a prime.
It is not a weakly prime, because it can be changed into another prime (112201012110133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56100506055068 + 56100506055069.
It is an arithmetic number, because the mean of its divisors is an integer number (56100506055069).
Almost surely, 2112201012110137 is an apocalyptic number.
It is an amenable number.
112201012110137 is a deficient number, since it is larger than the sum of its proper divisors (1).
112201012110137 is an equidigital number, since it uses as much as digits as its factorization.
112201012110137 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 23.
Adding to 112201012110137 its reverse (731011210102211), we get a palindrome (843212222212348).
The spelling of 112201012110137 in words is "one hundred twelve trillion, two hundred one billion, twelve million, one hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •