Base | Representation |
---|---|
bin | 101111110010111101011011… |
… | …000011110101111101001011 |
3 | 1000120021220001010212000100121 |
4 | 233302331123003311331023 |
5 | 210023040302144232334 |
6 | 2023025105314044111 |
7 | 62164115353246525 |
oct | 5762753303657513 |
9 | 1016256033760317 |
10 | 210210112102219 |
11 | 60a8567612a639 |
12 | 1b6b0165279637 |
13 | 903a961713bb8 |
14 | 39ca31bc18a15 |
15 | 19480aa0a9db4 |
hex | bf2f5b0f5f4b |
210210112102219 has 2 divisors, whose sum is σ = 210210112102220. Its totient is φ = 210210112102218.
The previous prime is 210210112102201. The next prime is 210210112102231. The reversal of 210210112102219 is 912201211012012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210210112102219 - 27 = 210210112102091 is a prime.
It is a super-2 number, since 2×2102101121022192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210210112102193 and 210210112102202.
It is not a weakly prime, because it can be changed into another prime (210210112102819) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105105056051109 + 105105056051110.
It is an arithmetic number, because the mean of its divisors is an integer number (105105056051110).
Almost surely, 2210210112102219 is an apocalyptic number.
210210112102219 is a deficient number, since it is larger than the sum of its proper divisors (1).
210210112102219 is an equidigital number, since it uses as much as digits as its factorization.
210210112102219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 25.
The spelling of 210210112102219 in words is "two hundred ten trillion, two hundred ten billion, one hundred twelve million, one hundred two thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •