Base | Representation |
---|---|
bin | 1011000000011101001001… |
… | …0110100100100100010101 |
3 | 1120211222112200121012202101 |
4 | 2300013102112210210111 |
5 | 3041241310203131031 |
6 | 41423442324042101 |
7 | 2356242020463031 |
oct | 260072226444425 |
9 | 46758480535671 |
10 | 12102452005141 |
11 | 3946691712733 |
12 | 1435652833331 |
13 | 69a3441c5c34 |
14 | 2dba945591c1 |
15 | 15ec2c555361 |
hex | b01d25a4915 |
12102452005141 has 2 divisors, whose sum is σ = 12102452005142. Its totient is φ = 12102452005140.
The previous prime is 12102452005103. The next prime is 12102452005157. The reversal of 12102452005141 is 14150025420121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6533187120100 + 5569264885041 = 2556010^2 + 2359929^2 .
It is a cyclic number.
It is not a de Polignac number, because 12102452005141 - 219 = 12102451480853 is a prime.
It is a super-2 number, since 2×121024520051412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12102452003141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6051226002570 + 6051226002571.
It is an arithmetic number, because the mean of its divisors is an integer number (6051226002571).
Almost surely, 212102452005141 is an apocalyptic number.
It is an amenable number.
12102452005141 is a deficient number, since it is larger than the sum of its proper divisors (1).
12102452005141 is an equidigital number, since it uses as much as digits as its factorization.
12102452005141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3200, while the sum is 28.
Adding to 12102452005141 its reverse (14150025420121), we get a palindrome (26252477425262).
The spelling of 12102452005141 in words is "twelve trillion, one hundred two billion, four hundred fifty-two million, five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •