Base | Representation |
---|---|
bin | 10100000110111001… |
… | …010101101000000000 |
3 | 2001201200101121000000 |
4 | 110012321111220000 |
5 | 323204133434220 |
6 | 13530224000000 |
7 | 1363014324144 |
oct | 240671255000 |
9 | 61650347000 |
10 | 21590530560 |
11 | 917a323195 |
12 | 4226760000 |
13 | 2061076491 |
14 | 108b633224 |
15 | 8656e9390 |
hex | 506e55a00 |
21590530560 has 560 divisors, whose sum is σ = 81150056064. Its totient is φ = 5496201216.
The previous prime is 21590530543. The next prime is 21590530573. The reversal of 21590530560 is 6503509512.
21590530560 is a `hidden beast` number, since 2 + 1 + 5 + 90 + 5 + 3 + 0 + 560 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 42923269 + ... + 42923771.
Almost surely, 221590530560 is an apocalyptic number.
21590530560 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 21590530560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (40575028032).
21590530560 is an abundant number, since it is smaller than the sum of its proper divisors (59559525504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21590530560 is an frugal number, since it uses more digits than its factorization.
21590530560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 567 (or 536 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 36.
The spelling of 21590530560 in words is "twenty-one billion, five hundred ninety million, five hundred thirty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •