Base | Representation |
---|---|
bin | 1011010111100110101000… |
… | …0011110011001011110101 |
3 | 1122021000000211211111202102 |
4 | 2311321222003303023311 |
5 | 3114300233324243331 |
6 | 42330252105551445 |
7 | 2430050656455446 |
oct | 265715203631365 |
9 | 48230024744672 |
10 | 12500134212341 |
11 | 3a8a305980a96 |
12 | 149a7397a5585 |
13 | 6c89b059c539 |
14 | 31301c97b2cd |
15 | 16a2557154cb |
hex | b5e6a0f32f5 |
12500134212341 has 2 divisors, whose sum is σ = 12500134212342. Its totient is φ = 12500134212340.
The previous prime is 12500134212271. The next prime is 12500134212343. The reversal of 12500134212341 is 14321243100521.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7265876589841 + 5234257622500 = 2695529^2 + 2287850^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12500134212341 is a prime.
Together with 12500134212343, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12500134212343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6250067106170 + 6250067106171.
It is an arithmetic number, because the mean of its divisors is an integer number (6250067106171).
Almost surely, 212500134212341 is an apocalyptic number.
It is an amenable number.
12500134212341 is a deficient number, since it is larger than the sum of its proper divisors (1).
12500134212341 is an equidigital number, since it uses as much as digits as its factorization.
12500134212341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5760, while the sum is 29.
Adding to 12500134212341 its reverse (14321243100521), we get a palindrome (26821377312862).
The spelling of 12500134212341 in words is "twelve trillion, five hundred billion, one hundred thirty-four million, two hundred twelve thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •