Base | Representation |
---|---|
bin | 100001001001011… |
… | …0000001010001101 |
3 | 2212111211020012002 |
4 | 1002102300022031 |
5 | 4234211241414 |
6 | 302210322045 |
7 | 36363434621 |
oct | 10222601215 |
9 | 2774736162 |
10 | 1112212109 |
11 | 5208a6468 |
12 | 270589325 |
13 | 149568398 |
14 | a79db181 |
15 | 679994de |
hex | 424b028d |
1112212109 has 2 divisors, whose sum is σ = 1112212110. Its totient is φ = 1112212108.
The previous prime is 1112212091. The next prime is 1112212117. The reversal of 1112212109 is 9012122111.
Together with previous prime (1112212091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1108224100 + 3988009 = 33290^2 + 1997^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112212109 - 216 = 1112146573 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112217109) 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, 556106054 + 556106055.
It is an arithmetic number, because the mean of its divisors is an integer number (556106055).
Almost surely, 21112212109 is an apocalyptic number.
It is an amenable number.
1112212109 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112212109 is an equidigital number, since it uses as much as digits as its factorization.
1112212109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The square root of 1112212109 is about 33349.8442125297. The cubic root of 1112212109 is about 1036.0861613591.
The spelling of 1112212109 in words is "one billion, one hundred twelve million, two hundred twelve thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •