Base | Representation |
---|---|
bin | 10100110000010111… |
… | …001011101100011100 |
3 | 2010112011110021120210 |
4 | 110300113023230130 |
5 | 331120233020220 |
6 | 14123235012420 |
7 | 1416162513336 |
oct | 246027135434 |
9 | 63464407523 |
10 | 22286220060 |
11 | 94a6a98a95 |
12 | 439b73a110 |
13 | 2142236880 |
14 | 1115ba8456 |
15 | 8a68196e0 |
hex | 5305cbb1c |
22286220060 has 48 divisors (see below), whose sum is σ = 67201527456. Its totient is φ = 5485838592.
The previous prime is 22286220017. The next prime is 22286220067. The reversal of 22286220060 is 6002268222.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22286220067) 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, 14285259 + ... + 14286818.
It is an arithmetic number, because the mean of its divisors is an integer number (1400031822).
Almost surely, 222286220060 is an apocalyptic number.
22286220060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22286220060 is an abundant number, since it is smaller than the sum of its proper divisors (44915307396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22286220060 is a wasteful number, since it uses less digits than its factorization.
22286220060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28572102 (or 28572100 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 30.
Adding to 22286220060 its reverse (6002268222), we get a palindrome (28288488282).
The spelling of 22286220060 in words is "twenty-two billion, two hundred eighty-six million, two hundred twenty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •