Base | Representation |
---|---|
bin | 100111000101000… |
… | …1101100110101101 |
3 | 10101101102221110011 |
4 | 1032022031212231 |
5 | 10141143100023 |
6 | 334041413221 |
7 | 44331603052 |
oct | 11612154655 |
9 | 3341387404 |
10 | 1311300013 |
11 | 613216121 |
12 | 30719a211 |
13 | 17b89348a |
14 | c6223029 |
15 | 7a1c350d |
hex | 4e28d9ad |
1311300013 has 2 divisors, whose sum is σ = 1311300014. Its totient is φ = 1311300012.
The previous prime is 1311299999. The next prime is 1311300059. The reversal of 1311300013 is 3100031131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 719205124 + 592094889 = 26818^2 + 24333^2 .
It is an emirp because it is prime and its reverse (3100031131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1311300013 - 217 = 1311168941 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1311299966 and 1311300002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1311300073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655650006 + 655650007.
It is an arithmetic number, because the mean of its divisors is an integer number (655650007).
Almost surely, 21311300013 is an apocalyptic number.
It is an amenable number.
1311300013 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311300013 is an equidigital number, since it uses as much as digits as its factorization.
1311300013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27, while the sum is 13.
The square root of 1311300013 is about 36211.8766843145. The cubic root of 1311300013 is about 1094.5460091963.
Adding to 1311300013 its reverse (3100031131), we get a palindrome (4411331144).
The spelling of 1311300013 in words is "one billion, three hundred eleven million, three hundred thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •