Base | Representation |
---|---|
bin | 10100000010110001… |
… | …011110110010001100 |
3 | 2001112212020110122201 |
4 | 110002301132302030 |
5 | 323033432041220 |
6 | 13515313251244 |
7 | 1361214362542 |
oct | 240261366214 |
9 | 61485213581 |
10 | 21521362060 |
11 | 914427a940 |
12 | 4207563b24 |
13 | 204c939283 |
14 | 1082389d92 |
15 | 85e5d4d0a |
hex | 502c5ec8c |
21521362060 has 96 divisors (see below), whose sum is σ = 49682626560. Its totient is φ = 7766035200.
The previous prime is 21521362019. The next prime is 21521362069. The reversal of 21521362060 is 6026312512.
It is not an unprimeable number, because it can be changed into a prime (21521362069) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20873745 + ... + 20874775.
It is an arithmetic number, because the mean of its divisors is an integer number (517527360).
Almost surely, 221521362060 is an apocalyptic number.
21521362060 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 21521362060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24841313280).
21521362060 is an abundant number, since it is smaller than the sum of its proper divisors (28161264500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21521362060 is a wasteful number, since it uses less digits than its factorization.
21521362060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1687 (or 1685 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
Adding to 21521362060 its reverse (6026312512), we get a palindrome (27547674572).
The spelling of 21521362060 in words is "twenty-one billion, five hundred twenty-one million, three hundred sixty-two thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •