Base | Representation |
---|---|
bin | 1011010101101100100100… |
… | …1100100100000110100001 |
3 | 1122010212110111022220120021 |
4 | 2311123021030210012201 |
5 | 3113231133333411014 |
6 | 42303233032113441 |
7 | 2424511031432263 |
oct | 265331114440641 |
9 | 48125414286507 |
10 | 12467370607009 |
11 | 3a7742275840a |
12 | 1494315235881 |
13 | 6c588b7b0a16 |
14 | 3115d14a3b33 |
15 | 169489190624 |
hex | b56c93241a1 |
12467370607009 has 2 divisors, whose sum is σ = 12467370607010. Its totient is φ = 12467370607008.
The previous prime is 12467370606959. The next prime is 12467370607051. The reversal of 12467370607009 is 90070607376421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9501559651600 + 2965810955409 = 3082460^2 + 1722153^2 .
It is a cyclic number.
It is not a de Polignac number, because 12467370607009 - 29 = 12467370606497 is a prime.
It is a super-2 number, since 2×124673706070092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12467370607079) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6233685303504 + 6233685303505.
It is an arithmetic number, because the mean of its divisors is an integer number (6233685303505).
Almost surely, 212467370607009 is an apocalyptic number.
It is an amenable number.
12467370607009 is a deficient number, since it is larger than the sum of its proper divisors (1).
12467370607009 is an equidigital number, since it uses as much as digits as its factorization.
12467370607009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2667168, while the sum is 52.
The spelling of 12467370607009 in words is "twelve trillion, four hundred sixty-seven billion, three hundred seventy million, six hundred seven thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •