Base | Representation |
---|---|
bin | 110000001110011111011111… |
… | …100001111101111100100011 |
3 | 1000210222202122102212221000021 |
4 | 300032133133201331330203 |
5 | 210300040120232431034 |
6 | 2031034211401534311 |
7 | 62450605156612525 |
oct | 6016373741757443 |
9 | 1023882572787007 |
10 | 212102120202019 |
11 | 616450053aa423 |
12 | 1b95698aaa4397 |
13 | 91471b48003b8 |
14 | 3a53b2408ba15 |
15 | 197c3e24026b4 |
hex | c0e7df87df23 |
212102120202019 has 2 divisors, whose sum is σ = 212102120202020. Its totient is φ = 212102120202018.
The previous prime is 212102120201929. The next prime is 212102120202031. The reversal of 212102120202019 is 910202021201212.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212102120202019 - 213 = 212102120193827 is a prime.
It is a super-2 number, since 2×2121021202020192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212102120201984 and 212102120202002.
It is not a weakly prime, because it can be changed into another prime (212102120202619) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106051060101009 + 106051060101010.
It is an arithmetic number, because the mean of its divisors is an integer number (106051060101010).
Almost surely, 2212102120202019 is an apocalyptic number.
212102120202019 is a deficient number, since it is larger than the sum of its proper divisors (1).
212102120202019 is an equidigital number, since it uses as much as digits as its factorization.
212102120202019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 212102120202019 in words is "two hundred twelve trillion, one hundred two billion, one hundred twenty million, two hundred two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •