Base | Representation |
---|---|
bin | 110000010001010111111110… |
… | …000101001000001101110011 |
3 | 1000211200200221001021210110002 |
4 | 300101113332011020031303 |
5 | 210311311303003344334 |
6 | 2031305211021500215 |
7 | 62501116616565503 |
oct | 6021277605101563 |
9 | 1024620831253402 |
10 | 212300201231219 |
11 | 61711011a38442 |
12 | 1b98924ba1166b |
13 | 915ca913a5b9a |
14 | 3a5d555367a03 |
15 | 198263716cb7e |
hex | c115fe148373 |
212300201231219 has 2 divisors, whose sum is σ = 212300201231220. Its totient is φ = 212300201231218.
The previous prime is 212300201231207. The next prime is 212300201231273. The reversal of 212300201231219 is 912132102003212.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212300201231219 - 228 = 212299932795763 is a prime.
It is a super-2 number, since 2×2123002012312192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212300201231191 and 212300201231200.
It is not a weakly prime, because it can be changed into another prime (212300201131219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106150100615609 + 106150100615610.
It is an arithmetic number, because the mean of its divisors is an integer number (106150100615610).
Almost surely, 2212300201231219 is an apocalyptic number.
212300201231219 is a deficient number, since it is larger than the sum of its proper divisors (1).
212300201231219 is an equidigital number, since it uses as much as digits as its factorization.
212300201231219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 212300201231219 in words is "two hundred twelve trillion, three hundred billion, two hundred one million, two hundred thirty-one thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •