Base | Representation |
---|---|
bin | 100011100001011101010111… |
… | …1011011001101111111011101 |
3 | 1111222100001120001102011022011 |
4 | 1013002322233123031333131 |
5 | 311423333243331310442 |
6 | 3024314550425351221 |
7 | 122546423014242562 |
oct | 10702725733157735 |
9 | 1458301501364264 |
10 | 312461813931997 |
11 | 90618347113734 |
12 | 2b065239338511 |
13 | 1054703a91a452 |
14 | 5723337d2c869 |
15 | 261ccaec87117 |
hex | 11c2eaf6cdfdd |
312461813931997 has 2 divisors, whose sum is σ = 312461813931998. Its totient is φ = 312461813931996.
The previous prime is 312461813931973. The next prime is 312461813932003. The reversal of 312461813931997 is 799139318164213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 177153411390201 + 135308402541796 = 13309899^2 + 11632214^2 .
It is a cyclic number.
It is not a de Polignac number, because 312461813931997 - 235 = 312427454193629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312461813931697) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156230906965998 + 156230906965999.
It is an arithmetic number, because the mean of its divisors is an integer number (156230906965999).
Almost surely, 2312461813931997 is an apocalyptic number.
It is an amenable number.
312461813931997 is a deficient number, since it is larger than the sum of its proper divisors (1).
312461813931997 is an equidigital number, since it uses as much as digits as its factorization.
312461813931997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 52907904, while the sum is 67.
The spelling of 312461813931997 in words is "three hundred twelve trillion, four hundred sixty-one billion, eight hundred thirteen million, nine hundred thirty-one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •