Base | Representation |
---|---|
bin | 100011011110111111110010… |
… | …0011101100011111010101101 |
3 | 1111221010201001111101100222201 |
4 | 1012331333210131203322231 |
5 | 311402312211214302112 |
6 | 3023455302220541501 |
7 | 122513112565440115 |
oct | 10675774435437255 |
9 | 1457121044340881 |
10 | 312123401322157 |
11 | 904a7878008097 |
12 | 2b00b7336b1891 |
13 | 10521158878609 |
14 | 5710bd3390045 |
15 | 26140a514e257 |
hex | 11bdfe4763ead |
312123401322157 has 2 divisors, whose sum is σ = 312123401322158. Its totient is φ = 312123401322156.
The previous prime is 312123401322151. The next prime is 312123401322241. The reversal of 312123401322157 is 751223104321213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 284217316692516 + 27906084629641 = 16858746^2 + 5282621^2 .
It is a cyclic number.
It is not a de Polignac number, because 312123401322157 - 211 = 312123401320109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312123401322151) 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, 156061700661078 + 156061700661079.
It is an arithmetic number, because the mean of its divisors is an integer number (156061700661079).
Almost surely, 2312123401322157 is an apocalyptic number.
It is an amenable number.
312123401322157 is a deficient number, since it is larger than the sum of its proper divisors (1).
312123401322157 is an equidigital number, since it uses as much as digits as its factorization.
312123401322157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60480, while the sum is 37.
The spelling of 312123401322157 in words is "three hundred twelve trillion, one hundred twenty-three billion, four hundred one million, three hundred twenty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •