| Base | Representation |
|---|---|
| bin | 10110101111001100010110… |
| … | …011100000100100000010000 |
| 3 | 111010001220201220111120012210 |
| 4 | 112233030112130010200100 |
| 5 | 101101400201100310000 |
| 6 | 552403224534152120 |
| 7 | 30030524462205501 |
| oct | 2657142634044020 |
| 9 | 433056656446183 |
| 10 | 100000100010000 |
| 11 | 29954893505173 |
| 12 | b2708331b2640 |
| 13 | 43a4c79a91168 |
| 14 | 1a9a060206ba8 |
| 15 | b86373477350 |
| hex | 5af316704810 |
100000100010000 has 200 divisors, whose sum is σ = 322825945004640. Its totient is φ = 26665678208000.
The previous prime is 100000100009987. The next prime is 100000100010001. The reversal of 100000100010000 is 10001000001.
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (3).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is not an unprimeable number, because it can be changed into a prime (100000100010001) by changing a digit.
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 39 ways as a sum of consecutive naturals, for example, 1114125124 + ... + 1114214876.
Almost surely, 2100000100010000 is an apocalyptic number.
100000100010000 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 100000100010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161412972502320).
100000100010000 is an abundant number, since it is smaller than the sum of its proper divisors (222825844994640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100000100010000 is an equidigital number, since it uses as much as digits as its factorization.
100000100010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 126923 (or 126902 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 3.
Adding to 100000100010000 its reverse (10001000001), we get a palindrome (100010101010001).
Subtracting from 100000100010000 its reverse (10001000001), we obtain a palindrome (99990099009999).
The spelling of 100000100010000 in words is "one hundred trillion, one hundred million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •