Base | Representation |
---|---|
bin | 10100010011010111… |
… | …010011110100000000 |
3 | 2002021021000012210121 |
4 | 110103113103310000 |
5 | 324121211322143 |
6 | 14003055310024 |
7 | 1401134340430 |
oct | 242327236400 |
9 | 62237005717 |
10 | 21799714048 |
11 | 9277408902 |
12 | 428481b314 |
13 | 20954c77a8 |
14 | 10ab3262c0 |
15 | 878c697ed |
hex | 5135d3d00 |
21799714048 has 72 divisors (see below), whose sum is σ = 50009158080. Its totient is φ = 9290403840.
The previous prime is 21799714007. The next prime is 21799714081. The reversal of 21799714048 is 84041799712.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 21799713986 and 21799714004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 286788 + ... + 354748.
It is an arithmetic number, because the mean of its divisors is an integer number (694571640).
Almost surely, 221799714048 is an apocalyptic number.
21799714048 is a gapful number since it is divisible by the number (28) 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 21799714048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25004579040).
21799714048 is an abundant number, since it is smaller than the sum of its proper divisors (28209444032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21799714048 is an equidigital number, since it uses as much as digits as its factorization.
21799714048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68163 (or 68149 counting only the distinct ones).
The product of its (nonzero) digits is 1016064, while the sum is 52.
The spelling of 21799714048 in words is "twenty-one billion, seven hundred ninety-nine million, seven hundred fourteen thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •