Base | Representation |
---|---|
bin | 10011110101101100… |
… | …101111011011000000 |
3 | 2000222120111111222201 |
4 | 103311230233123000 |
5 | 322111304000210 |
6 | 13441440042544 |
7 | 1352612100661 |
oct | 236554573300 |
9 | 60876444881 |
10 | 21302015680 |
11 | 9041483740 |
12 | 4166003454 |
13 | 201636a20a |
14 | 10611ad368 |
15 | 84a20853a |
hex | 4f5b2f6c0 |
21302015680 has 224 divisors, whose sum is σ = 58542082560. Its totient is φ = 7301652480.
The previous prime is 21302015677. The next prime is 21302015681. The reversal of 21302015680 is 8651020312.
It is not an unprimeable number, because it can be changed into a prime (21302015681) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15582357 + ... + 15583723.
Almost surely, 221302015680 is an apocalyptic number.
21302015680 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 21302015680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29271041280).
21302015680 is an abundant number, since it is smaller than the sum of its proper divisors (37240066880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21302015680 is a wasteful number, since it uses less digits than its factorization.
21302015680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1647 (or 1637 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 28.
Adding to 21302015680 its reverse (8651020312), we get a palindrome (29953035992).
The spelling of 21302015680 in words is "twenty-one billion, three hundred two million, fifteen thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •