Base | Representation |
---|---|
bin | 1011101101111010011… |
… | …1001100001111010101 |
3 | 201020121011200202111221 |
4 | 2323132213030033111 |
5 | 11244232121430232 |
6 | 232251044330341 |
7 | 20354324625313 |
oct | 2733647141725 |
9 | 636534622457 |
10 | 201303311317 |
11 | 78410520299 |
12 | 330200a39b1 |
13 | 15ca13463c4 |
14 | 9a592250b3 |
15 | 5382aba897 |
hex | 2ede9cc3d5 |
201303311317 has 2 divisors, whose sum is σ = 201303311318. Its totient is φ = 201303311316.
The previous prime is 201303311281. The next prime is 201303311323. The reversal of 201303311317 is 713113303102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 139643468721 + 61659842596 = 373689^2 + 248314^2 .
It is a cyclic number.
It is not a de Polignac number, because 201303311317 - 211 = 201303309269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 201303311291 and 201303311300.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (201303311327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 100651655658 + 100651655659.
It is an arithmetic number, because the mean of its divisors is an integer number (100651655659).
Almost surely, 2201303311317 is an apocalyptic number.
It is an amenable number.
201303311317 is a deficient number, since it is larger than the sum of its proper divisors (1).
201303311317 is an equidigital number, since it uses as much as digits as its factorization.
201303311317 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 201303311317 its reverse (713113303102), we get a palindrome (914416614419).
The spelling of 201303311317 in words is "two hundred one billion, three hundred three million, three hundred eleven thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •