Base | Representation |
---|---|
bin | 10110101111100100110110… |
… | …000010000101110011000000 |
3 | 111010011102121210100002112201 |
4 | 112233210312002011303000 |
5 | 101102313031331433430 |
6 | 552423254351402544 |
7 | 30032445302313520 |
oct | 2657446602056300 |
9 | 433142553302481 |
10 | 100026399874240 |
11 | 29964a5a056464 |
12 | b275952b23454 |
13 | 43a75ab6b58c8 |
14 | 1a9b437077680 |
15 | b86db230e8ca |
hex | 5af936085cc0 |
100026399874240 has 448 divisors, whose sum is σ = 291644172656640. Its totient is φ = 31951157575680.
The previous prime is 100026399874231. The next prime is 100026399874277. The reversal of 100026399874240 is 42478993620001.
It is a tau number, because it is divible by the number of its divisors (448).
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, 216540802 + ... + 217002238.
Almost surely, 2100026399874240 is an apocalyptic number.
100026399874240 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 100026399874240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (145822086328320).
100026399874240 is an abundant number, since it is smaller than the sum of its proper divisors (191617772782400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100026399874240 is a wasteful number, since it uses less digits than its factorization.
100026399874240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 461608 (or 461598 counting only the distinct ones).
The product of its (nonzero) digits is 5225472, while the sum is 55.
The spelling of 100026399874240 in words is "one hundred trillion, twenty-six billion, three hundred ninety-nine million, eight hundred seventy-four thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •