Base | Representation |
---|---|
bin | 110000001110100110110101… |
… | …010100101011100001101011 |
3 | 1000211000111222201220021020111 |
4 | 300032212311110223201223 |
5 | 210300202241003311334 |
6 | 2031041553440235151 |
7 | 62451304404102265 |
oct | 6016466524534153 |
9 | 1024014881807214 |
10 | 212110002010219 |
11 | 6164838a4905a5 |
12 | 1b95840a60bab7 |
13 | 9147b6c700631 |
14 | 3a54270b8ab35 |
15 | 197c704353064 |
hex | c0e9b552b86b |
212110002010219 has 2 divisors, whose sum is σ = 212110002010220. Its totient is φ = 212110002010218.
The previous prime is 212110002010199. The next prime is 212110002010223. The reversal of 212110002010219 is 912010200011212.
212110002010219 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 212110002010219 - 27 = 212110002010091 is a prime.
It is a super-2 number, since 2×2121100020102192 (a number of 29 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 212110002010219.
It is not a weakly prime, because it can be changed into another prime (212110002010519) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106055001005109 + 106055001005110.
It is an arithmetic number, because the mean of its divisors is an integer number (106055001005110).
Almost surely, 2212110002010219 is an apocalyptic number.
212110002010219 is a deficient number, since it is larger than the sum of its proper divisors (1).
212110002010219 is an equidigital number, since it uses as much as digits as its factorization.
212110002010219 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 22.
The spelling of 212110002010219 in words is "two hundred twelve trillion, one hundred ten billion, two million, ten thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •