Base | Representation |
---|---|
bin | 101001111110… |
… | …1100010010000 |
3 | 1112102020001012 |
4 | 1103331202100 |
5 | 21113310000 |
6 | 2103430052 |
7 | 355040045 |
oct | 123754220 |
9 | 45366035 |
10 | 22010000 |
11 | 11473491 |
12 | 7455328 |
13 | 473828c |
14 | 2ccd1cc |
15 | 1deb735 |
hex | 14fd890 |
22010000 has 100 divisors (see below), whose sum is σ = 55782144. Its totient is φ = 8400000.
The previous prime is 22009991. The next prime is 22010003. The reversal of 22010000 is 1022.
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22010003) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 309965 + ... + 310035.
Almost surely, 222010000 is an apocalyptic number.
22010000 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 22010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (27891072).
22010000 is an abundant number, since it is smaller than the sum of its proper divisors (33772144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22010000 is an equidigital number, since it uses as much as digits as its factorization.
22010000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 130 (or 109 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 5.
The square root of 22010000 is about 4691.4816422960. The cubic root of 22010000 is about 280.2463817759.
Adding to 22010000 its reverse (1022), we get a palindrome (22011022).
The spelling of 22010000 in words is "twenty-two million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •