Base | Representation |
---|---|
bin | 10000000010100000111… |
… | …101100001111010000000 |
3 | 10220101000001112200220211 |
4 | 100002200331201322000 |
5 | 121024312300041000 |
6 | 2202203234443504 |
7 | 142426562240446 |
oct | 20024075417200 |
9 | 3811001480824 |
10 | 1102212112000 |
11 | 39549a00352a |
12 | 159748733594 |
13 | 7cc2718a89c |
14 | 3b4c11b8b96 |
15 | 1da0ecb17ba |
hex | 100a0f61e80 |
1102212112000 has 128 divisors (see below), whose sum is σ = 2773394769600. Its totient is φ = 435572454400.
The previous prime is 1102212111983. The next prime is 1102212112021. The reversal of 1102212112000 is 2112122011.
It is a tau number, because it is divible by the number of its divisors (128).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 913011 + ... + 1742989.
Almost surely, 21102212112000 is an apocalyptic number.
1102212112000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1102212112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1386697384800).
1102212112000 is an abundant number, since it is smaller than the sum of its proper divisors (1671182657600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102212112000 is an frugal number, since it uses more digits than its factorization.
1102212112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 830091 (or 830069 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1102212112000 its reverse (2112122011), we get a palindrome (1104324234011).
The spelling of 1102212112000 in words is "one trillion, one hundred two billion, two hundred twelve million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •