Base | Representation |
---|---|
bin | 10100010100111001… |
… | …011001101000000000 |
3 | 2002100001101121200000 |
4 | 110110321121220000 |
5 | 324144302143333 |
6 | 14005414400000 |
7 | 1401566035221 |
oct | 242471315000 |
9 | 62301347600 |
10 | 21825427968 |
11 | 928a981083 |
12 | 4291360000 |
13 | 209a92b926 |
14 | 10b08db248 |
15 | 87b148713 |
hex | 514e59a00 |
21825427968 has 360 divisors, whose sum is σ = 69505468032. Its totient is φ = 6835912704.
The previous prime is 21825427963. The next prime is 21825427969. The reversal of 21825427968 is 86972452812.
21825427968 is a `hidden beast` number, since 2 + 1 + 8 + 2 + 542 + 7 + 96 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is not an unprimeable number, because it can be changed into a prime (21825427963) by changing a digit.
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 35 ways as a sum of consecutive naturals, for example, 35955921 + ... + 35956527.
Almost surely, 221825427968 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21825427968, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (34752734016).
21825427968 is an abundant number, since it is smaller than the sum of its proper divisors (47680040064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21825427968 is an frugal number, since it uses more digits than its factorization.
21825427968 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 674 (or 629 counting only the distinct ones).
The product of its digits is 3870720, while the sum is 54.
The spelling of 21825427968 in words is "twenty-one billion, eight hundred twenty-five million, four hundred twenty-seven thousand, nine hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •