Base | Representation |
---|---|
bin | 1100010010110010001… |
… | …1111100000011010001 |
3 | 202012010221222020212111 |
4 | 3010230203330003101 |
5 | 11430014430003032 |
6 | 241005134425321 |
7 | 21154521005245 |
oct | 3045443740321 |
9 | 665127866774 |
10 | 211201016017 |
11 | 8162a516332 |
12 | 34b22962241 |
13 | 16bbaa983c4 |
14 | a31795a425 |
15 | 57619bdc47 |
hex | 312c8fc0d1 |
211201016017 has 2 divisors, whose sum is σ = 211201016018. Its totient is φ = 211201016016.
The previous prime is 211201015981. The next prime is 211201016021. The reversal of 211201016017 is 710610102112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 205173667521 + 6027348496 = 452961^2 + 77636^2 .
It is a cyclic number.
It is not a de Polignac number, because 211201016017 - 223 = 211192627409 is a prime.
It is a super-3 number, since 3×2112010160173 (a number of 35 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (211201016087) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105600508008 + 105600508009.
It is an arithmetic number, because the mean of its divisors is an integer number (105600508009).
Almost surely, 2211201016017 is an apocalyptic number.
It is an amenable number.
211201016017 is a deficient number, since it is larger than the sum of its proper divisors (1).
211201016017 is an equidigital number, since it uses as much as digits as its factorization.
211201016017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 168, while the sum is 22.
Adding to 211201016017 its reverse (710610102112), we get a palindrome (921811118129).
The spelling of 211201016017 in words is "two hundred eleven billion, two hundred one million, sixteen thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •