Base | Representation |
---|---|
bin | 10100001110001111… |
… | …010010011001001000 |
3 | 2002001021012112000001 |
4 | 110032033102121020 |
5 | 323432203200000 |
6 | 13550344252344 |
7 | 1366041421462 |
oct | 241617223110 |
9 | 62037175001 |
10 | 21713725000 |
11 | 9232916a80 |
12 | 425ba710b4 |
13 | 208074b3b6 |
14 | 109db41132 |
15 | 87143146a |
hex | 50e3d2648 |
21713725000 has 192 divisors, whose sum is σ = 57945041280. Its totient is φ = 7550400000.
The previous prime is 21713724979. The next prime is 21713725001. The reversal of 21713725000 is 52731712.
It is a self number, because there is not a number n which added to its sum of digits gives 21713725000.
It is not an unprimeable number, because it can be changed into a prime (21713725001) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6323284 + ... + 6326716.
It is an arithmetic number, because the mean of its divisors is an integer number (301797090).
Almost surely, 221713725000 is an apocalyptic number.
21713725000 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 21713725000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28972520640).
21713725000 is an abundant number, since it is smaller than the sum of its proper divisors (36231316280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21713725000 is a wasteful number, since it uses less digits than its factorization.
21713725000 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 2940, while the sum is 28.
The spelling of 21713725000 in words is "twenty-one billion, seven hundred thirteen million, seven hundred twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •