Base | Representation |
---|---|
bin | 100011100000011000101100… |
… | …0101101011011010101100101 |
3 | 1111221210221212122202021101111 |
4 | 1013000301120231123111211 |
5 | 311413424222012340042 |
6 | 3024123120025225021 |
7 | 122532652151222101 |
oct | 10700613055332545 |
9 | 1457727778667344 |
10 | 312314330199397 |
11 | 9057084441a519 |
12 | 2b040739332171 |
13 | 10536165774916 |
14 | 571a146824901 |
15 | 261902c048517 |
hex | 11c0c58b5b565 |
312314330199397 has 2 divisors, whose sum is σ = 312314330199398. Its totient is φ = 312314330199396.
The previous prime is 312314330199343. The next prime is 312314330199409. The reversal of 312314330199397 is 793991033413213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 309372604398081 + 2941725801316 = 17588991^2 + 1715146^2 .
It is a cyclic number.
It is not a de Polignac number, because 312314330199397 - 27 = 312314330199269 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312314330199317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156157165099698 + 156157165099699.
It is an arithmetic number, because the mean of its divisors is an integer number (156157165099699).
Almost surely, 2312314330199397 is an apocalyptic number.
It is an amenable number.
312314330199397 is a deficient number, since it is larger than the sum of its proper divisors (1).
312314330199397 is an equidigital number, since it uses as much as digits as its factorization.
312314330199397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9920232, while the sum is 58.
The spelling of 312314330199397 in words is "three hundred twelve trillion, three hundred fourteen billion, three hundred thirty million, one hundred ninety-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •