Base | Representation |
---|---|
bin | 10000001011101010010… |
… | …001011110001101101001 |
3 | 10221022100102102021001222 |
4 | 100023222101132031221 |
5 | 121204420143323423 |
6 | 2210505505151425 |
7 | 143225122064102 |
oct | 20135221361551 |
9 | 3838312367058 |
10 | 1112032011113 |
11 | 399679097031 |
12 | 15b62932b575 |
13 | 80b3076a28a |
14 | 3bb734593a9 |
15 | 1ddd6e463c8 |
hex | 102ea45e369 |
1112032011113 has 2 divisors, whose sum is σ = 1112032011114. Its totient is φ = 1112032011112.
The previous prime is 1112032011059. The next prime is 1112032011143. The reversal of 1112032011113 is 3111102302111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 900549754729 + 211482256384 = 948973^2 + 459872^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112032011113 - 238 = 837154104169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112032011091 and 1112032011100.
It is not a weakly prime, because it can be changed into another prime (1112032011143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556016005556 + 556016005557.
It is an arithmetic number, because the mean of its divisors is an integer number (556016005557).
Almost surely, 21112032011113 is an apocalyptic number.
It is an amenable number.
1112032011113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112032011113 is an equidigital number, since it uses as much as digits as its factorization.
1112032011113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 1112032011113 its reverse (3111102302111), we get a palindrome (4223134313224).
The spelling of 1112032011113 in words is "one trillion, one hundred twelve billion, thirty-two million, eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •