Base | Representation |
---|---|
bin | 10101000110110000… |
… | …111001100000011100 |
3 | 2011111100122221010210 |
4 | 111012300321200130 |
5 | 332402441410220 |
6 | 14224422332420 |
7 | 1431405221643 |
oct | 250660714034 |
9 | 64440587123 |
10 | 22662060060 |
11 | 967a162162 |
12 | 448558a110 |
13 | 21a20693c3 |
14 | 114da8035a |
15 | 8c98096e0 |
hex | 546c3981c |
22662060060 has 24 divisors (see below), whose sum is σ = 63453768336. Its totient is φ = 6043216000.
The previous prime is 22662060059. The next prime is 22662060061. The reversal of 22662060060 is 6006026622.
It is an interprime number because it is at equal distance from previous prime (22662060059) and next prime (22662060061).
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 (22662060061) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 188850441 + ... + 188850560.
It is an arithmetic number, because the mean of its divisors is an integer number (2643907014).
Almost surely, 222662060060 is an apocalyptic number.
22662060060 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22662060060 is an abundant number, since it is smaller than the sum of its proper divisors (40791708276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22662060060 is a wasteful number, since it uses less digits than its factorization.
22662060060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377701013 (or 377701011 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 30.
Adding to 22662060060 its reverse (6006026622), we get a palindrome (28668086682).
The spelling of 22662060060 in words is "twenty-two billion, six hundred sixty-two million, sixty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •