Base | Representation |
---|---|
bin | 10100010100110100… |
… | …011110001110001000 |
3 | 2002022221221222112000 |
4 | 110110310132032020 |
5 | 324143434323242 |
6 | 14005330551000 |
7 | 1401552044604 |
oct | 242464361610 |
9 | 62287858460 |
10 | 21824136072 |
11 | 928a1794a2 |
12 | 4290a38460 |
13 | 209a5988ab |
14 | 10b0682504 |
15 | 87ae90a4c |
hex | 514d1e388 |
21824136072 has 32 divisors (see below), whose sum is σ = 60622600800. Its totient is φ = 7274711952.
The previous prime is 21824136023. The next prime is 21824136077. The reversal of 21824136072 is 27063142812.
It is a happy number.
21824136072 is a `hidden beast` number, since 2 + 1 + 8 + 2 + 41 + 3 + 607 + 2 = 666.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (21824136077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50518618 + ... + 50519049.
It is an arithmetic number, because the mean of its divisors is an integer number (1894456275).
Almost surely, 221824136072 is an apocalyptic number.
It is an amenable number.
21824136072 is an abundant number, since it is smaller than the sum of its proper divisors (38798464728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21824136072 is a wasteful number, since it uses less digits than its factorization.
21824136072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101037682 (or 101037672 counting only the distinct ones).
The product of its (nonzero) digits is 32256, while the sum is 36.
Adding to 21824136072 its reverse (27063142812), we get a palindrome (48887278884).
The spelling of 21824136072 in words is "twenty-one billion, eight hundred twenty-four million, one hundred thirty-six thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •