Base | Representation |
---|---|
bin | 111110101001001… |
… | …1111100110010110 |
3 | 12102111021122221200 |
4 | 1331102133212112 |
5 | 13301103000042 |
6 | 544325053330 |
7 | 103042463643 |
oct | 17522374626 |
9 | 5374248850 |
10 | 2102000022 |
11 | 989584801 |
12 | 4a7b57246 |
13 | 27663b2c5 |
14 | 15d24adca |
15 | c480ec4c |
hex | 7d49f996 |
2102000022 has 24 divisors (see below), whose sum is σ = 4556555640. Its totient is φ = 700324800.
The previous prime is 2102000009. The next prime is 2102000023. The reversal of 2102000022 is 2200002012.
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 = 2101999968 and 2102000013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2102000023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10897 + ... + 65747.
It is an arithmetic number, because the mean of its divisors is an integer number (189856485).
Almost surely, 22102000022 is an apocalyptic number.
2102000022 is an abundant number, since it is smaller than the sum of its proper divisors (2454555618).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2102000022 is a wasteful number, since it uses less digits than its factorization.
2102000022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56988 (or 56985 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 9.
The square root of 2102000022 is about 45847.5737853161. The cubic root of 2102000022 is about 1280.9855735349.
Adding to 2102000022 its reverse (2200002012), we get a palindrome (4302002034).
The spelling of 2102000022 in words is "two billion, one hundred two million, twenty-two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •