Base | Representation |
---|---|
bin | 101010110011… |
… | …0101010101100 |
3 | 1120020002202002 |
4 | 1111212222230 |
5 | 21221044440 |
6 | 2120551432 |
7 | 361512356 |
oct | 125465254 |
9 | 46202662 |
10 | 22440620 |
11 | 11737a74 |
12 | 7622578 |
13 | 4859297 |
14 | 2da20d6 |
15 | 1e84115 |
hex | 1566aac |
22440620 has 24 divisors (see below), whose sum is σ = 48129984. Its totient is φ = 8784896.
The previous prime is 22440599. The next prime is 22440623. The reversal of 22440620 is 2604422.
22440620 = T140 + T141 + ... + T515.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a plaindrome in base 16.
It is a junction number, because it is equal to n+sod(n) for n = 22440592 and 22440601.
It is not an unprimeable number, because it can be changed into a prime (22440623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10997 + ... + 12876.
It is an arithmetic number, because the mean of its divisors is an integer number (2005416).
Almost surely, 222440620 is an apocalyptic number.
22440620 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22440620 is an abundant number, since it is smaller than the sum of its proper divisors (25689364).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22440620 is a wasteful number, since it uses less digits than its factorization.
22440620 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23929 (or 23927 counting only the distinct ones).
The product of its (nonzero) digits is 768, while the sum is 20.
The square root of 22440620 is about 4737.1531535301. The cubic root of 22440620 is about 282.0622400052.
The spelling of 22440620 in words is "twenty-two million, four hundred forty thousand, six hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.590 sec. • engine limits •