Base | Representation |
---|---|
bin | 1100001110101110011… |
… | …0010100011101000011 |
3 | 202002100000010212021111 |
4 | 3003223212110131003 |
5 | 11420301421334334 |
6 | 240305042304151 |
7 | 21115515030346 |
oct | 3035346243503 |
9 | 662300125244 |
10 | 210111121219 |
11 | 8112028322a |
12 | 34879958057 |
13 | 16a7604513c |
14 | a252ccc45d |
15 | 56eae82064 |
hex | 30eb994743 |
210111121219 has 2 divisors, whose sum is σ = 210111121220. Its totient is φ = 210111121218.
The previous prime is 210111121183. The next prime is 210111121301. The reversal of 210111121219 is 912121111012.
It is a happy number.
210111121219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 210111121219 - 29 = 210111120707 is a prime.
It is a super-2 number, since 2×2101111212192 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 210111121219.
It is not a weakly prime, because it can be changed into another prime (210111128219) 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 as a sum of consecutive naturals, namely, 105055560609 + 105055560610.
It is an arithmetic number, because the mean of its divisors is an integer number (105055560610).
Almost surely, 2210111121219 is an apocalyptic number.
210111121219 is a deficient number, since it is larger than the sum of its proper divisors (1).
210111121219 is an equidigital number, since it uses as much as digits as its factorization.
210111121219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 210111121219 in words is "two hundred ten billion, one hundred eleven million, one hundred twenty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •