| Base | Representation |
|---|---|
| bin | 10110101111010110100110… |
| … | …000110001000010010000000 |
| 3 | 111010002222010112010122100222 |
| 4 | 112233112212012020102000 |
| 5 | 101102040213112041000 |
| 6 | 552412244244402212 |
| 7 | 30031364202424640 |
| oct | 2657264606102200 |
| 9 | 433088115118328 |
| 10 | 100011100112000 |
| 11 | 29959518802660 |
| 12 | b2729a30a6368 |
| 13 | 43a6010a2305c |
| 14 | 1a9a7c5102520 |
| 15 | b867b9036a85 |
| hex | 5af5a6188480 |
100011100112000 has 512 divisors, whose sum is σ = 313078213393920. Its totient is φ = 30863616000000.
The previous prime is 100011100111999. The next prime is 100011100112039. The reversal of 100011100112000 is 211001110001.
It is a happy number.
100011100112000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1000111001120002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 124030130 + ... + 124833870.
It is an arithmetic number, because the mean of its divisors is an integer number (611480885535).
Almost surely, 2100011100112000 is an apocalyptic number.
100011100112000 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 100011100112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (156539106696960).
100011100112000 is an abundant number, since it is smaller than the sum of its proper divisors (213067113281920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100011100112000 is a wasteful number, since it uses less digits than its factorization.
100011100112000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 803889 (or 803867 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 100011100112000 its reverse (211001110001), we get a palindrome (100222101222001).
The spelling of 100011100112000 in words is "one hundred trillion, eleven billion, one hundred million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •