Base | Representation |
---|---|
bin | 100011011111000100010000… |
… | …1010100100101010011101011 |
3 | 1111221011121212022011022022111 |
4 | 1012332020201110211103223 |
5 | 311402441402123011243 |
6 | 3023503532025503151 |
7 | 122513603010505405 |
oct | 10676104124452353 |
9 | 1457147768138274 |
10 | 312133012313323 |
11 | 9050095a183aa3 |
12 | 2b011576341ab7 |
13 | 1052202aaa2236 |
14 | 57114659adb75 |
15 | 2614468cba39d |
hex | 11be2215254eb |
312133012313323 has 2 divisors, whose sum is σ = 312133012313324. Its totient is φ = 312133012313322.
The previous prime is 312133012313299. The next prime is 312133012313329. The reversal of 312133012313323 is 323313210331213.
It is a happy number.
It is a strong prime.
It is an emirp because it is prime and its reverse (323313210331213) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312133012313323 is a prime.
It is not a weakly prime, because it can be changed into another prime (312133012313329) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156066506156661 + 156066506156662.
It is an arithmetic number, because the mean of its divisors is an integer number (156066506156662).
Almost surely, 2312133012313323 is an apocalyptic number.
312133012313323 is a deficient number, since it is larger than the sum of its proper divisors (1).
312133012313323 is an equidigital number, since it uses as much as digits as its factorization.
312133012313323 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 31.
Adding to 312133012313323 its reverse (323313210331213), we get a palindrome (635446222644536).
The spelling of 312133012313323 in words is "three hundred twelve trillion, one hundred thirty-three billion, twelve million, three hundred thirteen thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •