Base | Representation |
---|---|
bin | 100111000100100… |
… | …1001010010101001 |
3 | 10101100220201121202 |
4 | 1032021021102221 |
5 | 10141110121301 |
6 | 334031413545 |
7 | 44326326221 |
oct | 11611112251 |
9 | 3340821552 |
10 | 1311020201 |
11 | 613044977 |
12 | 3070842b5 |
13 | 17b7c5cca |
14 | c618d081 |
15 | 7a16a66b |
hex | 4e2494a9 |
1311020201 has 2 divisors, whose sum is σ = 1311020202. Its totient is φ = 1311020200.
The previous prime is 1311020167. The next prime is 1311020233. The reversal of 1311020201 is 1020201131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1044840976 + 266179225 = 32324^2 + 16315^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311020201 - 214 = 1311003817 is a prime.
It is not a weakly prime, because it can be changed into another prime (1311020251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655510100 + 655510101.
It is an arithmetic number, because the mean of its divisors is an integer number (655510101).
Almost surely, 21311020201 is an apocalyptic number.
It is an amenable number.
1311020201 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311020201 is an equidigital number, since it uses as much as digits as its factorization.
1311020201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 11.
The square root of 1311020201 is about 36208.0129391272. The cubic root of 1311020201 is about 1094.4681503561.
Adding to 1311020201 its reverse (1020201131), we get a palindrome (2331221332).
It can be divided in two parts, 131 and 1020201, that multiplied together give a palindrome (133646331).
The spelling of 1311020201 in words is "one billion, three hundred eleven million, twenty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •