Base | Representation |
---|---|
bin | 10100010111011100… |
… | …101011001111000000 |
3 | 2002110000221011102110 |
4 | 110113130223033000 |
5 | 324241231321233 |
6 | 14013544015320 |
7 | 1402625612223 |
oct | 242734531700 |
9 | 62400834373 |
10 | 21868229568 |
11 | 93020555a9 |
12 | 42a3761540 |
13 | 20a6766713 |
14 | 10b647d5ba |
15 | 87eca0663 |
hex | 51772b3c0 |
21868229568 has 112 divisors (see below), whose sum is σ = 58539806720. Its totient is φ = 7204184064.
The previous prime is 21868229567. The next prime is 21868229611. The reversal of 21868229568 is 86592286812.
It is a happy number.
It is a Smith number, since the sum of its digits (57) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21868229563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6899088 + ... + 6902256.
Almost surely, 221868229568 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 21868229568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (29269903360).
21868229568 is an abundant number, since it is smaller than the sum of its proper divisors (36671577152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21868229568 is a wasteful number, since it uses less digits than its factorization.
21868229568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3594 (or 3584 counting only the distinct ones).
The product of its digits is 6635520, while the sum is 57.
The spelling of 21868229568 in words is "twenty-one billion, eight hundred sixty-eight million, two hundred twenty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •