Base | Representation |
---|---|
bin | 110100001101001010… |
… | …1100001101010100101 |
3 | 101201101012121220021202 |
4 | 1220122111201222211 |
5 | 3314100404001404 |
6 | 123300355452245 |
7 | 11046133531034 |
oct | 1503225415245 |
9 | 351335556252 |
10 | 112111000229 |
11 | 436008118a8 |
12 | 198898b7085 |
13 | a758969977 |
14 | 55d76d471b |
15 | 2db25d421e |
hex | 1a1a561aa5 |
112111000229 has 2 divisors, whose sum is σ = 112111000230. Its totient is φ = 112111000228.
The previous prime is 112111000219. The next prime is 112111000231. The reversal of 112111000229 is 922000111211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 76561783204 + 35549217025 = 276698^2 + 188545^2 .
It is a cyclic number.
It is not a de Polignac number, because 112111000229 - 228 = 111842564773 is a prime.
Together with 112111000231, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112111000229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112111000219) 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, 56055500114 + 56055500115.
It is an arithmetic number, because the mean of its divisors is an integer number (56055500115).
Almost surely, 2112111000229 is an apocalyptic number.
It is an amenable number.
112111000229 is a deficient number, since it is larger than the sum of its proper divisors (1).
112111000229 is an equidigital number, since it uses as much as digits as its factorization.
112111000229 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 spelling of 112111000229 in words is "one hundred twelve billion, one hundred eleven million, two hundred twenty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •