| Base | Representation |
|---|---|
| bin | 10110101111001101001100… |
| … | …101111100110100101100000 |
| 3 | 111010002000002101212201201212 |
| 4 | 112233031030233212211200 |
| 5 | 101101404032320200000 |
| 6 | 552403455202045252 |
| 7 | 30030556164303533 |
| oct | 2657151457464540 |
| 9 | 433060071781655 |
| 10 | 100001011100000 |
| 11 | 2995521082160a |
| 12 | b270a48349828 |
| 13 | 43a509376b57a |
| 14 | 1a9a10920ca1a |
| 15 | b863c8444c35 |
| hex | 5af34cbe6960 |
100001011100000 has 144 divisors (see below), whose sum is σ = 248258219582016. Its totient is φ = 39646414080000.
The previous prime is 100001011099991. The next prime is 100001011100009. The reversal of 100001011100000 is 1110100001.
It is an interprime number because it is at equal distance from previous prime (100001011099991) and next prime (100001011100009).
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001011100009) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6875177 + ... + 15724823.
It is an arithmetic number, because the mean of its divisors is an integer number (1724015413764).
Almost surely, 2100001011100000 is an apocalyptic number.
100001011100000 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 100001011100000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124129109791008).
100001011100000 is an abundant number, since it is smaller than the sum of its proper divisors (148257208482016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001011100000 is an frugal number, since it uses more digits than its factorization.
100001011100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8849795 (or 8849767 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 100001011100000 its reverse (1110100001), we get a palindrome (100002121200001).
Subtracting from 100001011100000 its reverse (1110100001), we obtain a palindrome (99999900999999).
The spelling of 100001011100000 in words is "one hundred trillion, one billion, eleven million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •