Base | Representation |
---|---|
bin | 10100000111110100… |
… | …000101101011100110 |
3 | 2001202202101001110110 |
4 | 110013310011223212 |
5 | 323222104304000 |
6 | 13531534033450 |
7 | 1363262250444 |
oct | 240764055346 |
9 | 61682331413 |
10 | 21605931750 |
11 | 9187a92347 |
12 | 422b948886 |
13 | 2064309600 |
14 | 108d6c1b94 |
15 | 866c3c850 |
hex | 507d05ae6 |
21605931750 has 192 divisors, whose sum is σ = 58680528192. Its totient is φ = 5292518400.
The previous prime is 21605931733. The next prime is 21605931761. The reversal of 21605931750 is 5713950612.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 21605931699 and 21605931708.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 47277522 + ... + 47277978.
It is an arithmetic number, because the mean of its divisors is an integer number (305627751).
Almost surely, 221605931750 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21605931750, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29340264096).
21605931750 is an abundant number, since it is smaller than the sum of its proper divisors (37074596442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21605931750 is a wasteful number, since it uses less digits than its factorization.
21605931750 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 876 (or 853 counting only the distinct ones).
The product of its (nonzero) digits is 56700, while the sum is 39.
The spelling of 21605931750 in words is "twenty-one billion, six hundred five million, nine hundred thirty-one thousand, seven hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.492 sec. • engine limits •