Base | Representation |
---|---|
bin | 100011100001000110101101… |
… | …0011011111111100010110101 |
3 | 1111222011101221010021112221001 |
4 | 1013002031122123333202311 |
5 | 311422034104204300344 |
6 | 3024240341115523301 |
7 | 122543050634642332 |
oct | 10702153233774265 |
9 | 1458141833245831 |
10 | 312413143431349 |
11 | 905a9740967184 |
12 | 2b057915759531 |
13 | 1054258244383c |
14 | 5720c3bddb989 |
15 | 261b8b1eaced4 |
hex | 11c235a6ff8b5 |
312413143431349 has 2 divisors, whose sum is σ = 312413143431350. Its totient is φ = 312413143431348.
The previous prime is 312413143431293. The next prime is 312413143431359. The reversal of 312413143431349 is 943134341314213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 218720229591249 + 93692913840100 = 14789193^2 + 9679510^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312413143431349 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 312413143431299 and 312413143431308.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312413143431359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156206571715674 + 156206571715675.
It is an arithmetic number, because the mean of its divisors is an integer number (156206571715675).
Almost surely, 2312413143431349 is an apocalyptic number.
It is an amenable number.
312413143431349 is a deficient number, since it is larger than the sum of its proper divisors (1).
312413143431349 is an equidigital number, since it uses as much as digits as its factorization.
312413143431349 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1119744, while the sum is 46.
The spelling of 312413143431349 in words is "three hundred twelve trillion, four hundred thirteen billion, one hundred forty-three million, four hundred thirty-one thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •