Base | Representation |
---|---|
bin | 10100011111100111… |
… | …010010101110111000 |
3 | 2002210120201112101210 |
4 | 110133213102232320 |
5 | 330031314334040 |
6 | 14035320243120 |
7 | 1406211242010 |
oct | 243747225670 |
9 | 62716645353 |
10 | 22005230520 |
11 | 9372419429 |
12 | 43216104a0 |
13 | 20c8c63980 |
14 | 10ca742c40 |
15 | 88bd13480 |
hex | 51f9d2bb8 |
22005230520 has 512 divisors, whose sum is σ = 84391372800. Its totient is φ = 4466368512.
The previous prime is 22005230501. The next prime is 22005230573. The reversal of 22005230520 is 2503250022.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 43232026 + ... + 43232534.
It is an arithmetic number, because the mean of its divisors is an integer number (164826900).
Almost surely, 222005230520 is an apocalyptic number.
22005230520 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 22005230520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (42195686400).
22005230520 is an abundant number, since it is smaller than the sum of its proper divisors (62386142280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22005230520 is a wasteful number, since it uses less digits than its factorization.
22005230520 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 687 (or 683 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 21.
Adding to 22005230520 its reverse (2503250022), we get a palindrome (24508480542).
The spelling of 22005230520 in words is "twenty-two billion, five million, two hundred thirty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •