Base | Representation |
---|---|
bin | 10100011111010100… |
… | …000111000100011010 |
3 | 2002210020021001120200 |
4 | 110133110013010122 |
5 | 330024022431020 |
6 | 14035020403030 |
7 | 1406120426433 |
oct | 243724070432 |
9 | 62706231520 |
10 | 22000202010 |
11 | 936a5a4436 |
12 | 431b9a6476 |
13 | 20c7bc2c17 |
14 | 10c9bd448a |
15 | 88b66d590 |
hex | 51f50711a |
22000202010 has 96 divisors (see below), whose sum is σ = 60611016960. Its totient is φ = 5517448704.
The previous prime is 22000201987. The next prime is 22000202017. The reversal of 22000202010 is 1020200022.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 22000201983 and 22000202001.
It is not an unprimeable number, because it can be changed into a prime (22000202017) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2356131 + ... + 2365449.
It is an arithmetic number, because the mean of its divisors is an integer number (631364760).
Almost surely, 222000202010 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22000202010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (30305508480).
22000202010 is an abundant number, since it is smaller than the sum of its proper divisors (38610814950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22000202010 is a wasteful number, since it uses less digits than its factorization.
22000202010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10892 (or 10889 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
Adding to 22000202010 its reverse (1020200022), we get a palindrome (23020402032).
The spelling of 22000202010 in words is "twenty-two billion, two hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •