Base | Representation |
---|---|
bin | 1010000000010110000110… |
… | …10111000101101110101010 |
3 | 2212220101021012000111020200 |
4 | 11000023003113011232222 |
5 | 10340440300111200020 |
6 | 114443343015333030 |
7 | 4430412360051342 |
oct | 500130327055652 |
9 | 85811235014220 |
10 | 22002100100010 |
11 | 7013046a05068 |
12 | 25741a2981176 |
13 | c37a3496c624 |
14 | 560c9b9c1d22 |
15 | 2824d23ea590 |
hex | 1402c35c5baa |
22002100100010 has 96 divisors (see below), whose sum is σ = 57362842293120. Its totient is φ = 5851106769024.
The previous prime is 22002100099997. The next prime is 22002100100023. The reversal of 22002100100010 is 1000100120022.
It is an interprime number because it is at equal distance from previous prime (22002100099997) and next prime (22002100100023).
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 = 22002100099965 and 22002100100001.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 48326352 + ... + 48779508.
It is an arithmetic number, because the mean of its divisors is an integer number (597529607220).
Almost surely, 222002100100010 is an apocalyptic number.
22002100100010 is an abundant number, since it is smaller than the sum of its proper divisors (35360742193110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22002100100010 is a wasteful number, since it uses less digits than its factorization.
22002100100010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 454652 (or 454649 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 22002100100010 its reverse (1000100120022), we get a palindrome (23002200220032).
The spelling of 22002100100010 in words is "twenty-two trillion, two billion, one hundred million, one hundred thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •