Base | Representation |
---|---|
bin | 1010000000100101001100… |
… | …01010001011001110100000 |
3 | 2212221011011200121122001002 |
4 | 11000102212022023032200 |
5 | 10341103342212004414 |
6 | 114451202450531132 |
7 | 4431120164024642 |
oct | 500224612131640 |
9 | 85834150548032 |
10 | 22010200109984 |
11 | 7016523180489 |
12 | 2575883596aa8 |
13 | c38725b2a938 |
14 | 561429680892 |
15 | 28280859d4de |
hex | 1404a628b3a0 |
22010200109984 has 192 divisors, whose sum is σ = 48044459232000. Its totient is φ = 9888056156160.
The previous prime is 22010200109977. The next prime is 22010200109987. The reversal of 22010200109984 is 48990100201022.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is not an unprimeable number, because it can be changed into a prime (22010200109987) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 143932637 + ... + 144085475.
It is an arithmetic number, because the mean of its divisors is an integer number (250231558500).
Almost surely, 222010200109984 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 22010200109984, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24022229616000).
22010200109984 is an abundant number, since it is smaller than the sum of its proper divisors (26034259122016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22010200109984 is a wasteful number, since it uses less digits than its factorization.
22010200109984 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 153071 (or 153063 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 38.
The spelling of 22010200109984 in words is "twenty-two trillion, ten billion, two hundred million, one hundred nine thousand, nine hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •