Base | Representation |
---|---|
bin | 100011011111101000001011… |
… | …0100011001110000010110101 |
3 | 1111221102222221112102011120112 |
4 | 1012333100112203032002311 |
5 | 311410222332044342044 |
6 | 3024003205253312405 |
7 | 122522303225565512 |
oct | 10677202643160265 |
9 | 1457388845364515 |
10 | 312210141012149 |
11 | 90530639332aa6 |
12 | 2b024500635705 |
13 | 105293a00a3c73 |
14 | 57150a1284309 |
15 | 261648016809e |
hex | 11bf4168ce0b5 |
312210141012149 has 2 divisors, whose sum is σ = 312210141012150. Its totient is φ = 312210141012148.
The previous prime is 312210141012061. The next prime is 312210141012151. The reversal of 312210141012149 is 941210141012213.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 311582865924100 + 627275088049 = 17651710^2 + 792007^2 .
It is a cyclic number.
It is not a de Polignac number, because 312210141012149 - 244 = 294617954967733 is a prime.
It is a Sophie Germain prime.
Together with 312210141012151, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312210143012149) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156105070506074 + 156105070506075.
It is an arithmetic number, because the mean of its divisors is an integer number (156105070506075).
Almost surely, 2312210141012149 is an apocalyptic number.
It is an amenable number.
312210141012149 is a deficient number, since it is larger than the sum of its proper divisors (1).
312210141012149 is an equidigital number, since it uses as much as digits as its factorization.
312210141012149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 32.
The spelling of 312210141012149 in words is "three hundred twelve trillion, two hundred ten billion, one hundred forty-one million, twelve thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •