Base | Representation |
---|---|
bin | 111110111100100… |
… | …0100011001100101 |
3 | 12110012022102021212 |
4 | 1331321010121211 |
5 | 13311200042404 |
6 | 545325521205 |
7 | 103224441413 |
oct | 17571043145 |
9 | 5405272255 |
10 | 2112112229 |
11 | 9942611a7 |
12 | 4ab413205 |
13 | 27876bc66 |
14 | 1607202b3 |
15 | c565b06e |
hex | 7de44665 |
2112112229 has 2 divisors, whose sum is σ = 2112112230. Its totient is φ = 2112112228.
The previous prime is 2112112217. The next prime is 2112112231. The reversal of 2112112229 is 9222112112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1219895329 + 892216900 = 34927^2 + 29870^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112112229 - 24 = 2112112213 is a prime.
It is a super-2 number, since 2×21121122292 = 8922036135782696882, which contains 22 as substring.
Together with 2112112231, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2112112259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056056114 + 1056056115.
It is an arithmetic number, because the mean of its divisors is an integer number (1056056115).
Almost surely, 22112112229 is an apocalyptic number.
It is an amenable number.
2112112229 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112112229 is an equidigital number, since it uses as much as digits as its factorization.
2112112229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 288, while the sum is 23.
The square root of 2112112229 is about 45957.7221911617. The cubic root of 2112112229 is about 1283.0364575030.
The spelling of 2112112229 in words is "two billion, one hundred twelve million, one hundred twelve thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •