Base | Representation |
---|---|
bin | 100011011111101000101010… |
… | …1110111010000100110110011 |
3 | 1111221110002200120011102201021 |
4 | 1012333101111313100212303 |
5 | 311410232021011331011 |
6 | 3024003502520320311 |
7 | 122522341444362112 |
oct | 10677212567204663 |
9 | 1457402616142637 |
10 | 312211203230131 |
11 | 905310339920a7 |
12 | 2b024758313097 |
13 | 1052950c18680a |
14 | 5715162389c79 |
15 | 26164e3539471 |
hex | 11bf455dd09b3 |
312211203230131 has 2 divisors, whose sum is σ = 312211203230132. Its totient is φ = 312211203230130.
The previous prime is 312211203230123. The next prime is 312211203230149. The reversal of 312211203230131 is 131032302112213.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 312211203230131 - 23 = 312211203230123 is a prime.
It is a super-2 number, since 2×3122112032301312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 312211203230096 and 312211203230105.
It is not a weakly prime, because it can be changed into another prime (312211203231131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156105601615065 + 156105601615066.
It is an arithmetic number, because the mean of its divisors is an integer number (156105601615066).
Almost surely, 2312211203230131 is an apocalyptic number.
312211203230131 is a deficient number, since it is larger than the sum of its proper divisors (1).
312211203230131 is an equidigital number, since it uses as much as digits as its factorization.
312211203230131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 312211203230131 its reverse (131032302112213), we get a palindrome (443243505342344).
The spelling of 312211203230131 in words is "three hundred twelve trillion, two hundred eleven billion, two hundred three million, two hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •