Base | Representation |
---|---|
bin | 100001001001000… |
… | …0011101100000101 |
3 | 2212111110222022201 |
4 | 1002102003230011 |
5 | 4234134424312 |
6 | 302202354501 |
7 | 36362045563 |
oct | 10222035405 |
9 | 2774428281 |
10 | 1112029957 |
11 | 520791625 |
12 | 2704bba31 |
13 | 1495034bc |
14 | a7990a33 |
15 | 67960557 |
hex | 42483b05 |
1112029957 has 2 divisors, whose sum is σ = 1112029958. Its totient is φ = 1112029956.
The previous prime is 1112029937. The next prime is 1112030039. The reversal of 1112029957 is 7599202111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 951475716 + 160554241 = 30846^2 + 12671^2 .
It is an emirp because it is prime and its reverse (7599202111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1112029957 - 215 = 1111997189 is a prime.
It is a super-2 number, since 2×11120299572 = 2473221250530843698, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112029937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556014978 + 556014979.
It is an arithmetic number, because the mean of its divisors is an integer number (556014979).
Almost surely, 21112029957 is an apocalyptic number.
It is an amenable number.
1112029957 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112029957 is an equidigital number, since it uses as much as digits as its factorization.
1112029957 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 37.
The square root of 1112029957 is about 33347.1131734068. The cubic root of 1112029957 is about 1036.0295967678.
The spelling of 1112029957 in words is "one billion, one hundred twelve million, twenty-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •