Base | Representation |
---|---|
bin | 100111000101001… |
… | …0101000010011001 |
3 | 10101101111111012201 |
4 | 1032022111002121 |
5 | 10141200033312 |
6 | 334042210201 |
7 | 44332060603 |
oct | 11612250231 |
9 | 3341444181 |
10 | 1311330457 |
11 | 613236a88 |
12 | 3071b3961 |
13 | 17b8a42a8 |
14 | c6230173 |
15 | 7a1cc557 |
hex | 4e295099 |
1311330457 has 2 divisors, whose sum is σ = 1311330458. Its totient is φ = 1311330456.
The previous prime is 1311330437. The next prime is 1311330491. The reversal of 1311330457 is 7540331131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 974938176 + 336392281 = 31224^2 + 18341^2 .
It is an emirp because it is prime and its reverse (7540331131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1311330457 - 219 = 1310806169 is a prime.
It is not a weakly prime, because it can be changed into another prime (1311330407) 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, 655665228 + 655665229.
It is an arithmetic number, because the mean of its divisors is an integer number (655665229).
Almost surely, 21311330457 is an apocalyptic number.
It is an amenable number.
1311330457 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311330457 is an equidigital number, since it uses as much as digits as its factorization.
1311330457 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3780, while the sum is 28.
The square root of 1311330457 is about 36212.2970411986. The cubic root of 1311330457 is about 1094.5544796965.
Adding to 1311330457 its reverse (7540331131), we get a palindrome (8851661588).
The spelling of 1311330457 in words is "one billion, three hundred eleven million, three hundred thirty thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •