Base | Representation |
---|---|
bin | 1000001110111011… |
… | …1100001000001101 |
3 | 12201000201201221220 |
4 | 2003232330020031 |
5 | 14011242321310 |
6 | 1003150313553 |
7 | 105524466066 |
oct | 20356741015 |
9 | 5630651856 |
10 | 2210120205 |
11 | a34612027 |
12 | 5181b88b9 |
13 | 292b65b47 |
14 | 16d75356d |
15 | ce06a670 |
hex | 83bbc20d |
2210120205 has 8 divisors (see below), whose sum is σ = 3536192352. Its totient is φ = 1178730768.
The previous prime is 2210120201. The next prime is 2210120221. The reversal of 2210120205 is 5020210122.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2210120205 - 22 = 2210120201 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (15), and also a Moran number because the ratio is a prime number: 147341347 = 2210120205 / (2 + 2 + 1 + 0 + 1 + 2 + 0 + 2 + 0 + 5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2210120201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 73670659 + ... + 73670688.
It is an arithmetic number, because the mean of its divisors is an integer number (442024044).
Almost surely, 22210120205 is an apocalyptic number.
It is an amenable number.
2210120205 is a deficient number, since it is larger than the sum of its proper divisors (1326072147).
2210120205 is a wasteful number, since it uses less digits than its factorization.
2210120205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147341355.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 2210120205 is about 47011.9155640355. The cubic root of 2210120205 is about 1302.5826772992.
Adding to 2210120205 its reverse (5020210122), we get a palindrome (7230330327).
The spelling of 2210120205 in words is "two billion, two hundred ten million, one hundred twenty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •