Base | Representation |
---|---|
bin | 10110101111001101010010… |
… | …011000000111001101111100 |
3 | 111010002000022222201002220120 |
4 | 112233031102120013031330 |
5 | 101101404231013334000 |
6 | 552403512415414540 |
7 | 30030561422503011 |
oct | 2657152230071574 |
9 | 433060288632816 |
10 | 100001105605500 |
11 | 2995525a0aaa30 |
12 | b270a73b24450 |
13 | 43a50aa20a198 |
14 | 1a9a1179ad708 |
15 | b863d18b16a0 |
hex | 5af35260737c |
100001105605500 has 192 divisors, whose sum is σ = 334396042606080. Its totient is φ = 22966761024000.
The previous prime is 100001105605487. The next prime is 100001105605523. The reversal of 100001105605500 is 5506501100001.
It is a super-2 number, since 2×1000011056055002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 159177897 + ... + 159804896.
It is an arithmetic number, because the mean of its divisors is an integer number (1741646055240).
Almost surely, 2100001105605500 is an apocalyptic number.
100001105605500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100001105605500 is an abundant number, since it is smaller than the sum of its proper divisors (234394937000580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100001105605500 is a wasteful number, since it uses less digits than its factorization.
100001105605500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318982845 (or 318982833 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 100001105605500 its reverse (5506501100001), we get a palindrome (105507606705501).
The spelling of 100001105605500 in words is "one hundred trillion, one billion, one hundred five million, six hundred five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •