Base | Representation |
---|---|
bin | 1011001110011010000010… |
… | …1001011001001111000111 |
3 | 1121200220012200210021100011 |
4 | 2303212200221121033013 |
5 | 3104203143334402424 |
6 | 42125522113131051 |
7 | 2412455433100621 |
oct | 263464051311707 |
9 | 47626180707304 |
10 | 12342136247239 |
11 | 3a292a8175327 |
12 | 1473ba4559a87 |
13 | 6b6b21040266 |
14 | 309510cd1c11 |
15 | 1660a98dd694 |
hex | b39a0a593c7 |
12342136247239 has 2 divisors, whose sum is σ = 12342136247240. Its totient is φ = 12342136247238.
The previous prime is 12342136247201. The next prime is 12342136247251. The reversal of 12342136247239 is 93274263124321.
12342136247239 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12342136247239 is a prime.
It is a super-2 number, since 2×123421362472392 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12342136247192 and 12342136247201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12342136247279) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6171068123619 + 6171068123620.
It is an arithmetic number, because the mean of its divisors is an integer number (6171068123620).
Almost surely, 212342136247239 is an apocalyptic number.
12342136247239 is a deficient number, since it is larger than the sum of its proper divisors (1).
12342136247239 is an equidigital number, since it uses as much as digits as its factorization.
12342136247239 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2612736, while the sum is 49.
The spelling of 12342136247239 in words is "twelve trillion, three hundred forty-two billion, one hundred thirty-six million, two hundred forty-seven thousand, two hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •