Base | Representation |
---|---|
bin | 100001001001110… |
… | …0001001111100001 |
3 | 2212112012102222011 |
4 | 1002103201033201 |
5 | 4234234210103 |
6 | 302214512521 |
7 | 36365233015 |
oct | 10223411741 |
9 | 2775172864 |
10 | 1112413153 |
11 | 520a23515 |
12 | 270665741 |
13 | 149608a47 |
14 | a7a50545 |
15 | 679d8d6d |
hex | 424e13e1 |
1112413153 has 2 divisors, whose sum is σ = 1112413154. Its totient is φ = 1112413152.
The previous prime is 1112413109. The next prime is 1112413187. The reversal of 1112413153 is 3513142111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 686073249 + 426339904 = 26193^2 + 20648^2 .
It is an emirp because it is prime and its reverse (3513142111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1112413153 - 217 = 1112282081 is a prime.
It is not a weakly prime, because it can be changed into another prime (1112416153) 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, 556206576 + 556206577.
It is an arithmetic number, because the mean of its divisors is an integer number (556206577).
Almost surely, 21112413153 is an apocalyptic number.
It is an amenable number.
1112413153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112413153 is an equidigital number, since it uses as much as digits as its factorization.
1112413153 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 360, while the sum is 22.
The square root of 1112413153 is about 33352.8582433350. The cubic root of 1112413153 is about 1036.1485854103.
Adding to 1112413153 its reverse (3513142111), we get a palindrome (4625555264).
The spelling of 1112413153 in words is "one billion, one hundred twelve million, four hundred thirteen thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •