Base | Representation |
---|---|
bin | 110000000001100010101100… |
… | …110000101110001000111111 |
3 | 1000200211200122002012220111111 |
4 | 300001202230300232020333 |
5 | 210141000101302414101 |
6 | 2025113314434102451 |
7 | 62326402315454215 |
oct | 6001425460561077 |
9 | 1020750562186444 |
10 | 211212210201151 |
11 | 61331660405295 |
12 | 1b832411a1aa27 |
13 | 90b12c25831a3 |
14 | 3a22a22b74cb5 |
15 | 19641aab10251 |
hex | c018acc2e23f |
211212210201151 has 2 divisors, whose sum is σ = 211212210201152. Its totient is φ = 211212210201150.
The previous prime is 211212210201101. The next prime is 211212210201199. The reversal of 211212210201151 is 151102012212112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211212210201151 - 213 = 211212210192959 is a prime.
It is a super-2 number, since 2×2112122102011512 (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 (211212210201101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105606105100575 + 105606105100576.
It is an arithmetic number, because the mean of its divisors is an integer number (105606105100576).
Almost surely, 2211212210201151 is an apocalyptic number.
211212210201151 is a deficient number, since it is larger than the sum of its proper divisors (1).
211212210201151 is an equidigital number, since it uses as much as digits as its factorization.
211212210201151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160, while the sum is 22.
Adding to 211212210201151 its reverse (151102012212112), we get a palindrome (362314222413263).
The spelling of 211212210201151 in words is "two hundred eleven trillion, two hundred twelve billion, two hundred ten million, two hundred one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •