Base | Representation |
---|---|
bin | 100110111010… |
… | …1111111001110 |
3 | 1102101202002000 |
4 | 1031311333032 |
5 | 20210444342 |
6 | 2005213130 |
7 | 335310234 |
oct | 115657716 |
9 | 42352060 |
10 | 20406222 |
11 | 10578551 |
12 | 6a011a6 |
13 | 42c62b5 |
14 | 29d2954 |
15 | 1bd144c |
hex | 1375fce |
20406222 has 32 divisors (see below), whose sum is σ = 48016800. Its totient is φ = 6401664.
The previous prime is 20406167. The next prime is 20406223. The reversal of 20406222 is 22260402.
It is a happy number.
20406222 is a `hidden beast` number, since 2 + 0 + 40 + 622 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 20406195 and 20406204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20406223) 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, 10197 + ... + 12032.
It is an arithmetic number, because the mean of its divisors is an integer number (1500525).
Almost surely, 220406222 is an apocalyptic number.
20406222 is an abundant number, since it is smaller than the sum of its proper divisors (27610578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20406222 is a wasteful number, since it uses less digits than its factorization.
20406222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22257 (or 22251 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
The square root of 20406222 is about 4517.3246507197. The cubic root of 20406222 is about 273.2672181289.
Adding to 20406222 its reverse (22260402), we get a palindrome (42666624).
The spelling of 20406222 in words is "twenty million, four hundred six thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •