Base | Representation |
---|---|
bin | 10011000110000010100… |
… | …011101101001011001101 |
3 | 11122102220100220221110012 |
4 | 103012002203231023031 |
5 | 132444243242022222 |
6 | 2442443524323005 |
7 | 163541302033565 |
oct | 23060243551315 |
9 | 4572810827405 |
10 | 1312155423437 |
11 | 46653358a791 |
12 | 19237a243465 |
13 | 969745095a1 |
14 | 47719aa3da5 |
15 | 241eb1471e2 |
hex | 131828ed2cd |
1312155423437 has 2 divisors, whose sum is σ = 1312155423438. Its totient is φ = 1312155423436.
The previous prime is 1312155423413. The next prime is 1312155423457. The reversal of 1312155423437 is 7343245512131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1307521353961 + 4634069476 = 1143469^2 + 68074^2 .
It is a cyclic number.
It is not a de Polignac number, because 1312155423437 - 28 = 1312155423181 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1312155423394 and 1312155423403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1312155423457) 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, 656077711718 + 656077711719.
It is an arithmetic number, because the mean of its divisors is an integer number (656077711719).
Almost surely, 21312155423437 is an apocalyptic number.
It is an amenable number.
1312155423437 is a deficient number, since it is larger than the sum of its proper divisors (1).
1312155423437 is an equidigital number, since it uses as much as digits as its factorization.
1312155423437 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 302400, while the sum is 41.
The spelling of 1312155423437 in words is "one trillion, three hundred twelve billion, one hundred fifty-five million, four hundred twenty-three thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •