Base | Representation |
---|---|
bin | 10000000000100010110… |
… | …101110100100100110100 |
3 | 10220011112121000022100000 |
4 | 100000202311310210310 |
5 | 121010444104141400 |
6 | 2201213250351300 |
7 | 142323260043345 |
oct | 20004265644464 |
9 | 3804477008300 |
10 | 1100096162100 |
11 | 394603671001 |
12 | 159257b8b530 |
13 | 7c97a9a6c20 |
14 | 3b36017a0cc |
15 | 1d939148600 |
hex | 10022d74934 |
1100096162100 has 432 divisors, whose sum is σ = 3859734086208. Its totient is φ = 270176808960.
The previous prime is 1100096162071. The next prime is 1100096162141. The reversal of 1100096162100 is 12616900011.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 147521572 + ... + 147529028.
It is an arithmetic number, because the mean of its divisors is an integer number (8934569644).
Almost surely, 21100096162100 is an apocalyptic number.
1100096162100 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 1100096162100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1929867043104).
1100096162100 is an abundant number, since it is smaller than the sum of its proper divisors (2759637924108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100096162100 is a wasteful number, since it uses less digits than its factorization.
1100096162100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7966 (or 7947 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 27.
The spelling of 1100096162100 in words is "one trillion, one hundred billion, ninety-six million, one hundred sixty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •