Base | Representation |
---|---|
bin | 10000001011110100011… |
… | …010010110100011110110 |
3 | 10221022210021111020120000 |
4 | 100023310122112203312 |
5 | 121210242220024342 |
6 | 2210534423052130 |
7 | 143232255650556 |
oct | 20136432264366 |
9 | 3838707436500 |
10 | 1112202111222 |
11 | 399756107834 |
12 | 15b6762a1046 |
13 | 80b59a86027 |
14 | 3bb8bc97166 |
15 | 1dde6d4644c |
hex | 102f46968f6 |
1112202111222 has 20 divisors (see below), whose sum is σ = 2492156582916. Its totient is φ = 370734037020.
The previous prime is 1112202111197. The next prime is 1112202111247. The reversal of 1112202111222 is 2221112022111.
1112202111222 is a `hidden beast` number, since 1 + 11 + 220 + 211 + 1 + 222 = 666.
It is an interprime number because it is at equal distance from previous prime (1112202111197) and next prime (1112202111247).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 1112202111195 and 1112202111204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 3432722404 + ... + 3432722727.
Almost surely, 21112202111222 is an apocalyptic number.
1112202111222 is an abundant number, since it is smaller than the sum of its proper divisors (1379954471694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112202111222 is an equidigital number, since it uses as much as digits as its factorization.
1112202111222 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6865445145 (or 6865445136 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 1112202111222 its reverse (2221112022111), we get a palindrome (3333314133333).
The spelling of 1112202111222 in words is "one trillion, one hundred twelve billion, two hundred two million, one hundred eleven thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •