Base | Representation |
---|---|
bin | 1011010010000110010000… |
… | …1011101101101011100011 |
3 | 1121220221212212001220020112 |
4 | 2310201210023231223203 |
5 | 3111223024330440024 |
6 | 42215010155401535 |
7 | 2420162001032105 |
oct | 264414413555343 |
9 | 47827785056215 |
10 | 12405546343139 |
11 | 3a53187553964 |
12 | 14843404532ab |
13 | 6bcab8119671 |
14 | 30c60861d575 |
15 | 167a6b6e000e |
hex | b48642edae3 |
12405546343139 has 2 divisors, whose sum is σ = 12405546343140. Its totient is φ = 12405546343138.
The previous prime is 12405546343133. The next prime is 12405546343189. The reversal of 12405546343139 is 93134364550421.
12405546343139 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (12405546343189) can be obtained adding 12405546343139 to its sum of digits (50).
It is a weak prime.
It is an emirp because it is prime and its reverse (93134364550421) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12405546343139 - 228 = 12405277907683 is a prime.
It is not a weakly prime, because it can be changed into another prime (12405546343133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6202773171569 + 6202773171570.
It is an arithmetic number, because the mean of its divisors is an integer number (6202773171570).
Almost surely, 212405546343139 is an apocalyptic number.
12405546343139 is a deficient number, since it is larger than the sum of its proper divisors (1).
12405546343139 is an equidigital number, since it uses as much as digits as its factorization.
12405546343139 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4665600, while the sum is 50.
The spelling of 12405546343139 in words is "twelve trillion, four hundred five billion, five hundred forty-six million, three hundred forty-three thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •