Base | Representation |
---|---|
bin | 100011011110110101100000… |
… | …0010100000101010101010011 |
3 | 1111221001121001121112001202012 |
4 | 1012331223000110011111103 |
5 | 311401432000411140311 |
6 | 3023441211142013135 |
7 | 122511401441456561 |
oct | 10675530024052523 |
9 | 1457047047461665 |
10 | 312101320021331 |
11 | 90499476761a45 |
12 | 2b0073b07171ab |
13 | 1051c049c2c139 |
14 | 570dada8c8a31 |
15 | 261371181178b |
hex | 11bdac0505553 |
312101320021331 has 2 divisors, whose sum is σ = 312101320021332. Its totient is φ = 312101320021330.
The previous prime is 312101320021243. The next prime is 312101320021399. The reversal of 312101320021331 is 133120023101213.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312101320021331 is a prime.
It is a super-2 number, since 2×3121013200213312 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 312101320021297 and 312101320021306.
It is not a weakly prime, because it can be changed into another prime (312101320041331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156050660010665 + 156050660010666.
It is an arithmetic number, because the mean of its divisors is an integer number (156050660010666).
Almost surely, 2312101320021331 is an apocalyptic number.
312101320021331 is a deficient number, since it is larger than the sum of its proper divisors (1).
312101320021331 is an equidigital number, since it uses as much as digits as its factorization.
312101320021331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 312101320021331 its reverse (133120023101213), we get a palindrome (445221343122544).
The spelling of 312101320021331 in words is "three hundred twelve trillion, one hundred one billion, three hundred twenty million, twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •