Base | Representation |
---|---|
bin | 10000010011000110100… |
… | …000111001100100000000 |
3 | 10222001222021000021011211 |
4 | 100103012200321210000 |
5 | 121322301113310422 |
6 | 2214310410415504 |
7 | 143630122001605 |
oct | 20230640714400 |
9 | 3861867007154 |
10 | 1120022010112 |
11 | 3a1aa9253595 |
12 | 161099131594 |
13 | 81804bbb235 |
14 | 3c2d067c6ac |
15 | 1e203618577 |
hex | 104c6839900 |
1120022010112 has 72 divisors (see below), whose sum is σ = 2354798784800. Its totient is φ = 530206912512.
The previous prime is 1120022010109. The next prime is 1120022010181. The reversal of 1120022010112 is 2110102200211.
It is a junction number, because it is equal to n+sod(n) for n = 1120022010092 and 1120022010101.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7842964 + ... + 7984492.
Almost surely, 21120022010112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1120022010112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1177399392400).
1120022010112 is an abundant number, since it is smaller than the sum of its proper divisors (1234776774688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120022010112 is a wasteful number, since it uses less digits than its factorization.
1120022010112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143191 (or 143177 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1120022010112 its reverse (2110102200211), we get a palindrome (3230124210323).
The spelling of 1120022010112 in words is "one trillion, one hundred twenty billion, twenty-two million, ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •