Base | Representation |
---|---|
bin | 101010000101… |
… | …0001110110000 |
3 | 1112111212101010 |
4 | 1110022032300 |
5 | 21121441000 |
6 | 2104510520 |
7 | 355344462 |
oct | 124121660 |
9 | 45455333 |
10 | 22062000 |
11 | 114a9564 |
12 | 747b440 |
13 | 4755b4c |
14 | 2d04132 |
15 | 1e0bd50 |
hex | 150a3b0 |
22062000 has 80 divisors (see below), whose sum is σ = 71147232. Its totient is φ = 5881600.
The previous prime is 22061999. The next prime is 22062017. The reversal of 22062000 is 26022.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4162 + ... + 7838.
Almost surely, 222062000 is an apocalyptic number.
22062000 is a gapful number since it is divisible by the number (20) 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 22062000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (35573616).
22062000 is an abundant number, since it is smaller than the sum of its proper divisors (49085232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22062000 is a wasteful number, since it uses less digits than its factorization.
22062000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3703 (or 3687 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 22062000 is about 4697.0203320829. The cubic root of 22062000 is about 280.4669080594.
Adding to 22062000 its reverse (26022), we get a palindrome (22088022).
The spelling of 22062000 in words is "twenty-two million, sixty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •