Base | Representation |
---|---|
bin | 100001001001100… |
… | …1011010000101101 |
3 | 2212112000212110111 |
4 | 1002103023100231 |
5 | 4234223314432 |
6 | 302212540021 |
7 | 36364406353 |
oct | 10223132055 |
9 | 2775025414 |
10 | 1112323117 |
11 | 520971904 |
12 | 270621611 |
13 | 1495a6a79 |
14 | a7a297d3 |
15 | 679bc347 |
hex | 424cb42d |
1112323117 has 2 divisors, whose sum is σ = 1112323118. Its totient is φ = 1112323116.
The previous prime is 1112323109. The next prime is 1112323123. The reversal of 1112323117 is 7113232111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1070991076 + 41332041 = 32726^2 + 6429^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112323117 - 23 = 1112323109 is a prime.
It is a super-2 number, since 2×11123231172 = 2474525433225191378, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112323717) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556161558 + 556161559.
It is an arithmetic number, because the mean of its divisors is an integer number (556161559).
Almost surely, 21112323117 is an apocalyptic number.
It is an amenable number.
1112323117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112323117 is an equidigital number, since it uses as much as digits as its factorization.
1112323117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 252, while the sum is 22.
The square root of 1112323117 is about 33351.5084666346. The cubic root of 1112323117 is about 1036.1206302119.
Adding to 1112323117 its reverse (7113232111), we get a palindrome (8225555228).
The spelling of 1112323117 in words is "one billion, one hundred twelve million, three hundred twenty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •