Base | Representation |
---|---|
bin | 100011011111100100000001… |
… | …0111100000011001010011111 |
3 | 1111221102010220221210112222211 |
4 | 1012333020002330003022133 |
5 | 311410101100320323041 |
6 | 3023555132245021251 |
7 | 122521536215601052 |
oct | 10677100274031237 |
9 | 1457363827715884 |
10 | 312201222042271 |
11 | 90527881856a11 |
12 | 2b0228316b4827 |
13 | 105285ab354bb3 |
14 | 5714896922a99 |
15 | 261610c145481 |
hex | 11bf202f0329f |
312201222042271 has 2 divisors, whose sum is σ = 312201222042272. Its totient is φ = 312201222042270.
The previous prime is 312201222042257. The next prime is 312201222042361. The reversal of 312201222042271 is 172240222102213.
It is a weak prime.
It is an emirp because it is prime and its reverse (172240222102213) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 312201222042271 - 217 = 312201221911199 is a prime.
It is a super-2 number, since 2×3122012220422712 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (312201222042211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156100611021135 + 156100611021136.
It is an arithmetic number, because the mean of its divisors is an integer number (156100611021136).
Almost surely, 2312201222042271 is an apocalyptic number.
312201222042271 is a deficient number, since it is larger than the sum of its proper divisors (1).
312201222042271 is an equidigital number, since it uses as much as digits as its factorization.
312201222042271 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10752, while the sum is 31.
Adding to 312201222042271 its reverse (172240222102213), we get a palindrome (484441444144484).
The spelling of 312201222042271 in words is "three hundred twelve trillion, two hundred one billion, two hundred twenty-two million, forty-two thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •