Base | Representation |
---|---|
bin | 110000001110100111110000… |
… | …111111111101110101101111 |
3 | 1000211000121120111211122111011 |
4 | 300032213300333331311233 |
5 | 210300211313310310132 |
6 | 2031042241043410051 |
7 | 62451341252143312 |
oct | 6016476077756557 |
9 | 1024017514748434 |
10 | 212111003213167 |
11 | 61648853656153 |
12 | 1b958649983927 |
13 | 9147c9bc6c206 |
14 | 3a54327b2c979 |
15 | 197c7621c0b47 |
hex | c0e9f0ffdd6f |
212111003213167 has 2 divisors, whose sum is σ = 212111003213168. Its totient is φ = 212111003213166.
The previous prime is 212111003213117. The next prime is 212111003213177. The reversal of 212111003213167 is 761312300111212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212111003213167 - 215 = 212111003180399 is a prime.
It is a super-2 number, since 2×2121110032131672 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212111003213117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106055501606583 + 106055501606584.
It is an arithmetic number, because the mean of its divisors is an integer number (106055501606584).
Almost surely, 2212111003213167 is an apocalyptic number.
212111003213167 is a deficient number, since it is larger than the sum of its proper divisors (1).
212111003213167 is an equidigital number, since it uses as much as digits as its factorization.
212111003213167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3024, while the sum is 31.
Adding to 212111003213167 its reverse (761312300111212), we get a palindrome (973423303324379).
The spelling of 212111003213167 in words is "two hundred twelve trillion, one hundred eleven billion, three million, two hundred thirteen thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •