Base | Representation |
---|---|
bin | 100111000011001… |
… | …1111101010110111 |
3 | 10101022121102120112 |
4 | 1032012133222313 |
5 | 10140420403211 |
6 | 334004453235 |
7 | 44320403522 |
oct | 11606375267 |
9 | 3338542515 |
10 | 1310325431 |
11 | 61270a988 |
12 | 3069aa21b |
13 | 17b6119bc |
14 | c604bbb9 |
15 | 7a07e88b |
hex | 4e19fab7 |
1310325431 has 2 divisors, whose sum is σ = 1310325432. Its totient is φ = 1310325430.
The previous prime is 1310325407. The next prime is 1310325449. The reversal of 1310325431 is 1345230131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1310325431 - 226 = 1243216567 is a prime.
It is a super-2 number, since 2×13103254312 = 3433905470250671522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1310325397 and 1310325406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310325461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655162715 + 655162716.
It is an arithmetic number, because the mean of its divisors is an integer number (655162716).
Almost surely, 21310325431 is an apocalyptic number.
1310325431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310325431 is an equidigital number, since it uses as much as digits as its factorization.
1310325431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 1310325431 is about 36198.4175206597. The cubic root of 1310325431 is about 1094.2747798293.
Adding to 1310325431 its reverse (1345230131), we get a palindrome (2655555562).
The spelling of 1310325431 in words is "one billion, three hundred ten million, three hundred twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •