Base | Representation |
---|---|
bin | 100111001100110… |
… | …1010011110011111 |
3 | 10101200001201120122 |
4 | 1032121222132133 |
5 | 10143212203211 |
6 | 334304305155 |
7 | 44411202623 |
oct | 11631523637 |
9 | 3350051518 |
10 | 1315350431 |
11 | 61553227a |
12 | 3086121bb |
13 | 17c680c85 |
14 | c6999183 |
15 | 7a7236db |
hex | 4e66a79f |
1315350431 has 2 divisors, whose sum is σ = 1315350432. Its totient is φ = 1315350430.
The previous prime is 1315350329. The next prime is 1315350437. The reversal of 1315350431 is 1340535131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1315350431 - 210 = 1315349407 is a prime.
It is a super-2 number, since 2×13153504312 = 3460293512663771522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1315350431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1315350437) 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, 657675215 + 657675216.
It is an arithmetic number, because the mean of its divisors is an integer number (657675216).
Almost surely, 21315350431 is an apocalyptic number.
1315350431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1315350431 is an equidigital number, since it uses as much as digits as its factorization.
1315350431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 26.
The square root of 1315350431 is about 36267.7602148244. The cubic root of 1315350431 is about 1095.6718161437.
Adding to 1315350431 its reverse (1340535131), we get a palindrome (2655885562).
The spelling of 1315350431 in words is "one billion, three hundred fifteen million, three hundred fifty thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •