Base | Representation |
---|---|
bin | 1100101000101000011… |
… | …0110110100110101011 |
3 | 202202021122212200211202 |
4 | 3022022012312212223 |
5 | 12024022221322011 |
6 | 243415105114415 |
7 | 21453040413503 |
oct | 3121206664653 |
9 | 682248780752 |
10 | 217065417131 |
11 | 84069850722 |
12 | 3609a928a0b |
13 | 17613a38134 |
14 | a71274ca03 |
15 | 59a676e23b |
hex | 328a1b69ab |
217065417131 has 2 divisors, whose sum is σ = 217065417132. Its totient is φ = 217065417130.
The previous prime is 217065417089. The next prime is 217065417137. The reversal of 217065417131 is 131714560712.
It is a happy number.
217065417131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 217065417131 - 222 = 217061222827 is a prime.
It is a super-2 number, since 2×2170654171312 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (217065417137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 108532708565 + 108532708566.
It is an arithmetic number, because the mean of its divisors is an integer number (108532708566).
Almost surely, 2217065417131 is an apocalyptic number.
217065417131 is a deficient number, since it is larger than the sum of its proper divisors (1).
217065417131 is an equidigital number, since it uses as much as digits as its factorization.
217065417131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 35280, while the sum is 38.
Adding to 217065417131 its reverse (131714560712), we get a palindrome (348779977843).
The spelling of 217065417131 in words is "two hundred seventeen billion, sixty-five million, four hundred seventeen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •