Base | Representation |
---|---|
bin | 100111000100110… |
… | …1011100101010101 |
3 | 10101101011212021222 |
4 | 1032021223211111 |
5 | 10141124120121 |
6 | 334034420125 |
7 | 44330452556 |
oct | 11611534525 |
9 | 3341155258 |
10 | 1311160661 |
11 | 613130458 |
12 | 307131645 |
13 | 17b844c15 |
14 | c61c832d |
15 | 7a1970ab |
hex | 4e26b955 |
1311160661 has 2 divisors, whose sum is σ = 1311160662. Its totient is φ = 1311160660.
The previous prime is 1311160651. The next prime is 1311160663. The reversal of 1311160661 is 1660611131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1310874436 + 286225 = 36206^2 + 535^2 .
It is a cyclic number.
It is not a de Polignac number, because 1311160661 - 26 = 1311160597 is a prime.
Together with 1311160663, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1311160661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311160663) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655580330 + 655580331.
It is an arithmetic number, because the mean of its divisors is an integer number (655580331).
Almost surely, 21311160661 is an apocalyptic number.
It is an amenable number.
1311160661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311160661 is an equidigital number, since it uses as much as digits as its factorization.
1311160661 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 26.
The square root of 1311160661 is about 36209.9525130868. The cubic root of 1311160661 is about 1094.5072353136.
Adding to 1311160661 its reverse (1660611131), we get a palindrome (2971771792).
The spelling of 1311160661 in words is "one billion, three hundred eleven million, one hundred sixty thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •