Base | Representation |
---|---|
bin | 1100001110110001010… |
… | …0000001101111110011 |
3 | 202002100211200121111021 |
4 | 3003230110001233303 |
5 | 11420313003300334 |
6 | 240310151200311 |
7 | 21116021623321 |
oct | 3035424015763 |
9 | 662324617437 |
10 | 210123103219 |
11 | 81127017507 |
12 | 34881976097 |
13 | 16a7867bb93 |
14 | a25472ad11 |
15 | 56ec04c3b4 |
hex | 30ec501bf3 |
210123103219 has 2 divisors, whose sum is σ = 210123103220. Its totient is φ = 210123103218.
The previous prime is 210123103187. The next prime is 210123103237. The reversal of 210123103219 is 912301321012.
210123103219 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210123103219 - 25 = 210123103187 is a prime.
It is a super-2 number, since 2×2101231032192 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210123103193 and 210123103202.
It is not a weakly prime, because it can be changed into another prime (210123103249) 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, 105061551609 + 105061551610.
It is an arithmetic number, because the mean of its divisors is an integer number (105061551610).
Almost surely, 2210123103219 is an apocalyptic number.
210123103219 is a deficient number, since it is larger than the sum of its proper divisors (1).
210123103219 is an equidigital number, since it uses as much as digits as its factorization.
210123103219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 25.
The spelling of 210123103219 in words is "two hundred ten billion, one hundred twenty-three million, one hundred three thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •