Base | Representation |
---|---|
bin | 100110100100… |
… | …1000001110000 |
3 | 1102001101110100 |
4 | 1031021001300 |
5 | 20134101224 |
6 | 2001232400 |
7 | 333612312 |
oct | 115110160 |
9 | 42041410 |
10 | 20222064 |
11 | 10462155 |
12 | 6932700 |
13 | 4260525 |
14 | 29857b2 |
15 | 1b96ac9 |
hex | 1349070 |
20222064 has 60 divisors (see below), whose sum is σ = 56900376. Its totient is φ = 6704256.
The previous prime is 20222063. The next prime is 20222087. The reversal of 20222064 is 46022202.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20222063) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 45427 + ... + 45869.
Almost surely, 220222064 is an apocalyptic number.
20222064 is a gapful number since it is divisible by the number (24) 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 20222064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28450188).
20222064 is an abundant number, since it is smaller than the sum of its proper divisors (36678312).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20222064 is a wasteful number, since it uses less digits than its factorization.
20222064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774 (or 765 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 18.
The square root of 20222064 is about 4496.8949287258. The cubic root of 20222064 is about 272.4426903019.
Adding to 20222064 its reverse (46022202), we get a palindrome (66244266).
The spelling of 20222064 in words is "twenty million, two hundred twenty-two thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •