| Base | Representation |
|---|---|
| bin | 10110101111001101010010… |
| … | …000110100101010001010000 |
| 3 | 111010002000022200001122001212 |
| 4 | 112233031102012211101100 |
| 5 | 101101404223324310000 |
| 6 | 552403512133115252 |
| 7 | 30030561335443031 |
| oct | 2657152206452120 |
| 9 | 433060280048055 |
| 10 | 100001101010000 |
| 11 | 299552575512a3 |
| 12 | b270a72488b28 |
| 13 | 43a50a928b558 |
| 14 | 1a9a117134a88 |
| 15 | b863d12a4c35 |
| hex | 5af3521a5450 |
100001101010000 has 200 divisors, whose sum is σ = 242546180533800. Its totient is φ = 39928889088000.
The previous prime is 100001101009981. The next prime is 100001101010003. The reversal of 100001101010000 is 10101100001.
It can be written as a sum of positive squares in 20 ways, for example, as 97277822154304 + 2723278855696 = 9862952^2 + 1650236^2 .
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 (5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100001101010003) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 15691366814 + ... + 15691373186.
It is an arithmetic number, because the mean of its divisors is an integer number (1212730902669).
Almost surely, 2100001101010000 is an apocalyptic number.
100001101010000 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 100001101010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121273090266900).
100001101010000 is an abundant number, since it is smaller than the sum of its proper divisors (142545079523800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001101010000 is a wasteful number, since it uses less digits than its factorization.
100001101010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8963 (or 8942 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 5.
Adding to 100001101010000 its reverse (10101100001), we get a palindrome (100011202110001).
Subtracting from 100001101010000 its reverse (10101100001), we obtain a palindrome (99990999909999).
The spelling of 100001101010000 in words is "one hundred trillion, one billion, one hundred one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •