Base | Representation |
---|---|
bin | 1001000101100110011… |
… | …00010111010010001001 |
3 | 1002211221211012002020121 |
4 | 10202303030113102021 |
5 | 20103433431224243 |
6 | 355235400423241 |
7 | 31362461164024 |
oct | 4426314272211 |
9 | 1084854162217 |
10 | 312244008073 |
11 | 110470669838 |
12 | 50621a77b21 |
13 | 235a16b86ba |
14 | 1118131a1bb |
15 | 81c757d1ed |
hex | 48b3317489 |
312244008073 has 2 divisors, whose sum is σ = 312244008074. Its totient is φ = 312244008072.
The previous prime is 312244008061. The next prime is 312244008151. The reversal of 312244008073 is 370800442213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 184442763024 + 127801245049 = 429468^2 + 357493^2 .
It is an emirp because it is prime and its reverse (370800442213) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312244008073 is a prime.
It is a super-3 number, since 3×3122440080733 (a number of 35 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (312244008473) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 156122004036 + 156122004037.
It is an arithmetic number, because the mean of its divisors is an integer number (156122004037).
Almost surely, 2312244008073 is an apocalyptic number.
It is an amenable number.
312244008073 is a deficient number, since it is larger than the sum of its proper divisors (1).
312244008073 is an equidigital number, since it uses as much as digits as its factorization.
312244008073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32256, while the sum is 34.
The spelling of 312244008073 in words is "three hundred twelve billion, two hundred forty-four million, eight thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •