Base | Representation |
---|---|
bin | 1100010010000100111… |
… | …1111011101000000001 |
3 | 202011122201211201110002 |
4 | 3010201033323220001 |
5 | 11424122333101032 |
6 | 240534234445345 |
7 | 21150024536051 |
oct | 3044117735001 |
9 | 664581751402 |
10 | 211011222017 |
11 | 81542374292 |
12 | 34a8b293855 |
13 | 16b8a67566b |
14 | a2da673561 |
15 | 574eecd862 |
hex | 31213fba01 |
211011222017 has 2 divisors, whose sum is σ = 211011222018. Its totient is φ = 211011222016.
The previous prime is 211011221989. The next prime is 211011222041. The reversal of 211011222017 is 710222110112.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 135307001281 + 75704220736 = 367841^2 + 275144^2 .
It is a cyclic number.
It is not a de Polignac number, because 211011222017 - 214 = 211011205633 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 211011222017.
It is not a weakly prime, because it can be changed into another prime (211011222217) 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, 105505611008 + 105505611009.
It is an arithmetic number, because the mean of its divisors is an integer number (105505611009).
Almost surely, 2211011222017 is an apocalyptic number.
It is an amenable number.
211011222017 is a deficient number, since it is larger than the sum of its proper divisors (1).
211011222017 is an equidigital number, since it uses as much as digits as its factorization.
211011222017 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 211011222017 its reverse (710222110112), we get a palindrome (921233332129).
The spelling of 211011222017 in words is "two hundred eleven billion, eleven million, two hundred twenty-two thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •