| Base | Representation |
|---|---|
| bin | 10110101111001101001100… |
| … | …101011110101001000011000 |
| 3 | 111010002000002100000111002020 |
| 4 | 112233031030223311020120 |
| 5 | 101101404032042023000 |
| 6 | 552403455124534440 |
| 7 | 30030556153014255 |
| oct | 2657151453651030 |
| 9 | 433060070014066 |
| 10 | 100001010111000 |
| 11 | 29955210206559 |
| 12 | b270a47b51420 |
| 13 | 43a50934b336b |
| 14 | 1a9a10903242c |
| 15 | b863c82ebba0 |
| hex | 5af34caf5218 |
100001010111000 has 256 divisors, whose sum is σ = 323608335822720. Its totient is φ = 25689312000000.
The previous prime is 100001010110993. The next prime is 100001010111001. The reversal of 100001010111000 is 111010100001.
100001010111000 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a self number, because there is not a number n which added to its sum of digits gives 100001010111000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001010111001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 6751050 + ... + 15670950.
Almost surely, 2100001010111000 is an apocalyptic number.
100001010111000 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 100001010111000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161804167911360).
100001010111000 is an abundant number, since it is smaller than the sum of its proper divisors (223607325711720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001010111000 is a wasteful number, since it uses less digits than its factorization.
100001010111000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8920063 (or 8920049 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100001010111000 its reverse (111010100001), we get a palindrome (100112020211001).
The spelling of 100001010111000 in words is "one hundred trillion, one billion, ten million, one hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •