Base | Representation |
---|---|
bin | 11001011111011100101010… |
… | …111101111101000000001001 |
3 | 112200221211022121201210102012 |
4 | 121133130222331331000021 |
5 | 104143321343031224314 |
6 | 1034235354015145305 |
7 | 32420562060211535 |
oct | 3137345275750011 |
9 | 480854277653365 |
10 | 112112252211209 |
11 | 327a45a2681768 |
12 | 106a8132515235 |
13 | 4a731a8814a83 |
14 | 1d98394b62bc5 |
15 | ce646c3b993e |
hex | 65f72af7d009 |
112112252211209 has 4 divisors (see below), whose sum is σ = 115978191942660. Its totient is φ = 108246312479760.
The previous prime is 112112252211163. The next prime is 112112252211227. The reversal of 112112252211209 is 902112252211211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 69192917059984 + 42919335151225 = 8318228^2 + 6551285^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112112252211209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112112252213209) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1932969865682 + ... + 1932969865739.
It is an arithmetic number, because the mean of its divisors is an integer number (28994547985665).
Almost surely, 2112112252211209 is an apocalyptic number.
It is an amenable number.
112112252211209 is a deficient number, since it is larger than the sum of its proper divisors (3865939731451).
112112252211209 is an equidigital number, since it uses as much as digits as its factorization.
112112252211209 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3865939731450.
The product of its (nonzero) digits is 2880, while the sum is 32.
The spelling of 112112252211209 in words is "one hundred twelve trillion, one hundred twelve billion, two hundred fifty-two million, two hundred eleven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •