Base | Representation |
---|---|
bin | 1011000010101101010000… |
… | …0100100011110011011101 |
3 | 1120222200101121111120101221 |
4 | 2300223110010203303131 |
5 | 3042410021144343032 |
6 | 41453321034333341 |
7 | 2362111441232221 |
oct | 260532404436335 |
9 | 46880347446357 |
10 | 12141135543517 |
11 | 396103254a662 |
12 | 144104988a251 |
13 | 6a0b9a5c8806 |
14 | 2dd8c3d5c781 |
15 | 160c43699597 |
hex | b0ad4123cdd |
12141135543517 has 2 divisors, whose sum is σ = 12141135543518. Its totient is φ = 12141135543516.
The previous prime is 12141135543451. The next prime is 12141135543521. The reversal of 12141135543517 is 71534553114121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11847047338116 + 294088205401 = 3441954^2 + 542299^2 .
It is an emirp because it is prime and its reverse (71534553114121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12141135543517 - 223 = 12141127154909 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12141135541517) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6070567771758 + 6070567771759.
It is an arithmetic number, because the mean of its divisors is an integer number (6070567771759).
Almost surely, 212141135543517 is an apocalyptic number.
It is an amenable number.
12141135543517 is a deficient number, since it is larger than the sum of its proper divisors (1).
12141135543517 is an equidigital number, since it uses as much as digits as its factorization.
12141135543517 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 252000, while the sum is 43.
Adding to 12141135543517 its reverse (71534553114121), we get a palindrome (83675688657638).
The spelling of 12141135543517 in words is "twelve trillion, one hundred forty-one billion, one hundred thirty-five million, five hundred forty-three thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •