Base | Representation |
---|---|
bin | 1100001111100010111… |
… | …0101010001100010011 |
3 | 202002220100122202100101 |
4 | 3003320232222030103 |
5 | 11421224320124334 |
6 | 240342552033231 |
7 | 21124131332266 |
oct | 3037056521423 |
9 | 662810582311 |
10 | 210331411219 |
11 | 81223664386 |
12 | 3491b692817 |
13 | 16aac884857 |
14 | a274272cdd |
15 | 5710498214 |
hex | 30f8baa313 |
210331411219 has 2 divisors, whose sum is σ = 210331411220. Its totient is φ = 210331411218.
The previous prime is 210331411183. The next prime is 210331411247. The reversal of 210331411219 is 912114133012.
210331411219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (210331411247) can be obtained adding 210331411219 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210331411219 - 213 = 210331403027 is a prime.
It is a super-2 number, since 2×2103314112192 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (210331441219) 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, 105165705609 + 105165705610.
It is an arithmetic number, because the mean of its divisors is an integer number (105165705610).
Almost surely, 2210331411219 is an apocalyptic number.
210331411219 is a deficient number, since it is larger than the sum of its proper divisors (1).
210331411219 is an equidigital number, since it uses as much as digits as its factorization.
210331411219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 210331411219 in words is "two hundred ten billion, three hundred thirty-one million, four hundred eleven thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •