Base | Representation |
---|---|
bin | 10000001011101001000… |
… | …101111010000001111101 |
3 | 10221022022001010212020011 |
4 | 100023221011322001331 |
5 | 121204400110431414 |
6 | 2210503520423221 |
7 | 143224461521644 |
oct | 20135105720175 |
9 | 3838261125204 |
10 | 1112012202109 |
11 | 399668997256 |
12 | 15b622777b11 |
13 | 80b29622a83 |
14 | 3bb7098035b |
15 | 1ddd5331dc4 |
hex | 102e917a07d |
1112012202109 has 16 divisors (see below), whose sum is σ = 1184236329600. Its totient is φ = 1040547239424.
The previous prime is 1112012202101. The next prime is 1112012202113. The reversal of 1112012202109 is 9012022102111.
It is a cyclic number.
It is not a de Polignac number, because 1112012202109 - 23 = 1112012202101 is a prime.
It is a super-2 number, since 2×11120122021092 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1112012202109.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112012202101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16639249 + ... + 16705945.
It is an arithmetic number, because the mean of its divisors is an integer number (74014770600).
Almost surely, 21112012202109 is an apocalyptic number.
It is an amenable number.
1112012202109 is a deficient number, since it is larger than the sum of its proper divisors (72224127491).
1112012202109 is a wasteful number, since it uses less digits than its factorization.
1112012202109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72372.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 1112012202109 in words is "one trillion, one hundred twelve billion, twelve million, two hundred two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •