Base | Representation |
---|---|
bin | 10011000110000101010… |
… | …101010011010101100101 |
3 | 11122110000121112020000002 |
4 | 103012011111103111211 |
5 | 132444342201313422 |
6 | 2442452310231045 |
7 | 163542405535022 |
oct | 23060525232545 |
9 | 4573017466002 |
10 | 1312201979237 |
11 | 466557898856 |
12 | 192391955485 |
13 | 9698105a0b6 |
14 | 47721d42549 |
15 | 24200291692 |
hex | 13185553565 |
1312201979237 has 2 divisors, whose sum is σ = 1312201979238. Its totient is φ = 1312201979236.
The previous prime is 1312201979167. The next prime is 1312201979279. The reversal of 1312201979237 is 7329791022131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1284128641636 + 28073337601 = 1133194^2 + 167551^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312201979237 - 218 = 1312201717093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1312201979191 and 1312201979200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312201909237) 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, 656100989618 + 656100989619.
It is an arithmetic number, because the mean of its divisors is an integer number (656100989619).
Almost surely, 21312201979237 is an apocalyptic number.
It is an amenable number.
1312201979237 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312201979237 is an equidigital number, since it uses as much as digits as its factorization.
1312201979237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 285768, while the sum is 47.
The spelling of 1312201979237 in words is "one trillion, three hundred twelve billion, two hundred one million, nine hundred seventy-nine thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •