Base | Representation |
---|---|
bin | 100111000111011… |
… | …0011000101111001 |
3 | 10101110201000110021 |
4 | 1032032303011321 |
5 | 10142000032022 |
6 | 334123250441 |
7 | 44345040562 |
oct | 11616630571 |
9 | 3343630407 |
10 | 1312502137 |
11 | 613967311 |
12 | 307679a21 |
13 | 17bbc46ab |
14 | c6457169 |
15 | 7a35e7c7 |
hex | 4e3b3179 |
1312502137 has 2 divisors, whose sum is σ = 1312502138. Its totient is φ = 1312502136.
The previous prime is 1312502131. The next prime is 1312502143. The reversal of 1312502137 is 7312052131.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (1312502131) and next prime (1312502143).
It can be written as a sum of positive squares in only one way, i.e., 1306171881 + 6330256 = 36141^2 + 2516^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1312502137 is a prime.
It is not a weakly prime, because it can be changed into another prime (1312502131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 656251068 + 656251069.
It is an arithmetic number, because the mean of its divisors is an integer number (656251069).
Almost surely, 21312502137 is an apocalyptic number.
It is an amenable number.
1312502137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312502137 is an equidigital number, since it uses as much as digits as its factorization.
1312502137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1260, while the sum is 25.
The square root of 1312502137 is about 36228.4713588636. The cubic root of 1312502137 is about 1094.8803791959.
Adding to 1312502137 its reverse (7312052131), we get a palindrome (8624554268).
The spelling of 1312502137 in words is "one billion, three hundred twelve million, five hundred two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •