Base | Representation |
---|---|
bin | 1011000010101101100010… |
… | …0101100101100100010101 |
3 | 1120222200120220001220222012 |
4 | 2300223120211211210111 |
5 | 3042410200043412412 |
6 | 41453332342314005 |
7 | 2362113351234623 |
oct | 260533045454425 |
9 | 46880526056865 |
10 | 12141211310357 |
11 | 396107129a388 |
12 | 144106b128905 |
13 | 6a0bb020616c |
14 | 2dd8d0042513 |
15 | 160c4a163c22 |
hex | b0ad8965915 |
12141211310357 has 2 divisors, whose sum is σ = 12141211310358. Its totient is φ = 12141211310356.
The previous prime is 12141211310297. The next prime is 12141211310359. The reversal of 12141211310357 is 75301311214121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12123585827236 + 17625483121 = 3481894^2 + 132761^2 .
It is a cyclic number.
It is not a de Polignac number, because 12141211310357 - 216 = 12141211244821 is a prime.
Together with 12141211310359, 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 (12141211310359) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6070605655178 + 6070605655179.
It is an arithmetic number, because the mean of its divisors is an integer number (6070605655179).
Almost surely, 212141211310357 is an apocalyptic number.
It is an amenable number.
12141211310357 is a deficient number, since it is larger than the sum of its proper divisors (1).
12141211310357 is an equidigital number, since it uses as much as digits as its factorization.
12141211310357 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5040, while the sum is 32.
Adding to 12141211310357 its reverse (75301311214121), we get a palindrome (87442522524478).
The spelling of 12141211310357 in words is "twelve trillion, one hundred forty-one billion, two hundred eleven million, three hundred ten thousand, three hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •