Base | Representation |
---|---|
bin | 110100001111110110… |
… | …1111111100010010101 |
3 | 101201121111112121110001 |
4 | 1220133231333202111 |
5 | 3314242013100432 |
6 | 123313343131301 |
7 | 11051311213024 |
oct | 1503755774225 |
9 | 351544477401 |
10 | 112201300117 |
11 | 43647788505 |
12 | 198b3ba3b31 |
13 | a77159525a |
14 | 56056bc8bb |
15 | 2dba4be9e7 |
hex | 1a1fb7f895 |
112201300117 has 2 divisors, whose sum is σ = 112201300118. Its totient is φ = 112201300116.
The previous prime is 112201300097. The next prime is 112201300199. The reversal of 112201300117 is 711003102211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 64309916836 + 47891383281 = 253594^2 + 218841^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112201300117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112201300094 and 112201300103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112201307117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56100650058 + 56100650059.
It is an arithmetic number, because the mean of its divisors is an integer number (56100650059).
Almost surely, 2112201300117 is an apocalyptic number.
It is an amenable number.
112201300117 is a deficient number, since it is larger than the sum of its proper divisors (1).
112201300117 is an equidigital number, since it uses as much as digits as its factorization.
112201300117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 19.
Adding to 112201300117 its reverse (711003102211), we get a palindrome (823204402328).
The spelling of 112201300117 in words is "one hundred twelve billion, two hundred one million, three hundred thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •