Base | Representation |
---|---|
bin | 100011011111101000101111… |
… | …0001100110111011111011101 |
3 | 1111221110010001022101011210001 |
4 | 1012333101132030313133131 |
5 | 311410232312314042112 |
6 | 3024003524434414301 |
7 | 122522345063351326 |
oct | 10677213614673735 |
9 | 1457403038334701 |
10 | 312211343112157 |
11 | 905310a5943585 |
12 | 2b024797131391 |
13 | 10529532152248 |
14 | 5715176b9d44d |
15 | 261650096ac57 |
hex | 11bf45e3377dd |
312211343112157 has 2 divisors, whose sum is σ = 312211343112158. Its totient is φ = 312211343112156.
The previous prime is 312211343112089. The next prime is 312211343112247. The reversal of 312211343112157 is 751211343112213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 208865535656761 + 103345807455396 = 14452181^2 + 10165914^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312211343112157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312211343112457) 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, 156105671556078 + 156105671556079.
It is an arithmetic number, because the mean of its divisors is an integer number (156105671556079).
Almost surely, 2312211343112157 is an apocalyptic number.
It is an amenable number.
312211343112157 is a deficient number, since it is larger than the sum of its proper divisors (1).
312211343112157 is an equidigital number, since it uses as much as digits as its factorization.
312211343112157 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 30240, while the sum is 37.
The spelling of 312211343112157 in words is "three hundred twelve trillion, two hundred eleven billion, three hundred forty-three million, one hundred twelve thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •