Base | Representation |
---|---|
bin | 100111000011100… |
… | …1101100010001101 |
3 | 10101022221222021101 |
4 | 1032013031202031 |
5 | 10140442411133 |
6 | 334012503101 |
7 | 44322115315 |
oct | 11607154215 |
9 | 3338858241 |
10 | 1310513293 |
11 | 612829041 |
12 | 306a7aa91 |
13 | 17b67936b |
14 | c609a445 |
15 | 7a0ba37d |
hex | 4e1cd88d |
1310513293 has 2 divisors, whose sum is σ = 1310513294. Its totient is φ = 1310513292.
The previous prime is 1310513291. The next prime is 1310513329. The reversal of 1310513293 is 3923150131.
Together with next prime (1310513329) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1310295204 + 218089 = 36198^2 + 467^2 .
It is a cyclic number.
It is not a de Polignac number, because 1310513293 - 21 = 1310513291 is a prime.
It is a super-2 number, since 2×13105132932 = 3434890182259407698, which contains 22 as substring.
Together with 1310513291, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310513291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655256646 + 655256647.
It is an arithmetic number, because the mean of its divisors is an integer number (655256647).
Almost surely, 21310513293 is an apocalyptic number.
It is an amenable number.
1310513293 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310513293 is an equidigital number, since it uses as much as digits as its factorization.
1310513293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2430, while the sum is 28.
The square root of 1310513293 is about 36201.0123200996. The cubic root of 1310513293 is about 1094.3270729010.
The spelling of 1310513293 in words is "one billion, three hundred ten million, five hundred thirteen thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •