Base | Representation |
---|---|
bin | 1001000101110001000… |
… | …01011100101101100001 |
3 | 1002212012001102202021122 |
4 | 10202320201130231201 |
5 | 20104124323441114 |
6 | 355252313102025 |
7 | 31364625164222 |
oct | 4427041345541 |
9 | 1085161382248 |
10 | 312333421409 |
11 | 11050708a359 |
12 | 506479b7915 |
13 | 235b70935b9 |
14 | 1118d153249 |
15 | 81d0340e8e |
hex | 48b885cb61 |
312333421409 has 2 divisors, whose sum is σ = 312333421410. Its totient is φ = 312333421408.
The previous prime is 312333421399. The next prime is 312333421447. The reversal of 312333421409 is 904124333213.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 163460915809 + 148872505600 = 404303^2 + 385840^2 .
It is an emirp because it is prime and its reverse (904124333213) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-312333421409 is a prime.
It is a super-2 number, since 2×3123334214092 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (312333421459) 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, 156166710704 + 156166710705.
It is an arithmetic number, because the mean of its divisors is an integer number (156166710705).
Almost surely, 2312333421409 is an apocalyptic number.
It is an amenable number.
312333421409 is a deficient number, since it is larger than the sum of its proper divisors (1).
312333421409 is an equidigital number, since it uses as much as digits as its factorization.
312333421409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 35.
The spelling of 312333421409 in words is "three hundred twelve billion, three hundred thirty-three million, four hundred twenty-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •