Base | Representation |
---|---|
bin | 1001100110010100000110… |
… | …01110001101010101110100 |
3 | 2202201212120212112221100220 |
4 | 10303022003032031111310 |
5 | 10231312002213120000 |
6 | 112520421412134340 |
7 | 4305656521526400 |
oct | 463120316152564 |
9 | 82655525487326 |
10 | 21107670832500 |
11 | 67a8792a0001a |
12 | 244a9843073b0 |
13 | ba15a2361245 |
14 | 52d88c3c6100 |
15 | 2690d3eb11a0 |
hex | 13328338d574 |
21107670832500 has 720 divisors, whose sum is σ = 74038520489472. Its totient is φ = 4660346880000.
The previous prime is 21107670832489. The next prime is 21107670832513. The reversal of 21107670832500 is 523807670112.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 239 ways as a sum of consecutive naturals, for example, 7667151124 + ... + 7667153876.
Almost surely, 221107670832500 is an apocalyptic number.
21107670832500 is a gapful number since it is divisible by the number (20) 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 21107670832500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (37019260244736).
21107670832500 is an abundant number, since it is smaller than the sum of its proper divisors (52930849656972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21107670832500 is a wasteful number, since it uses less digits than its factorization.
21107670832500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3498 (or 3474 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 42.
The spelling of 21107670832500 in words is "twenty-one trillion, one hundred seven billion, six hundred seventy million, eight hundred thirty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •