Base | Representation |
---|---|
bin | 1011110001010001011100… |
… | …1011000001001100010001 |
3 | 1200211011022021020012011202 |
4 | 2330110113023001030101 |
5 | 3144011411024233111 |
6 | 43305023145520545 |
7 | 2503652101316606 |
oct | 274242713011421 |
9 | 50734267205152 |
10 | 12941125227281 |
11 | 413a3338a8639 |
12 | 15500b07a3155 |
13 | 72b45c3a26b4 |
14 | 32a4d4b9a6ad |
15 | 176965aeeb3b |
hex | bc5172c1311 |
12941125227281 has 2 divisors, whose sum is σ = 12941125227282. Its totient is φ = 12941125227280.
The previous prime is 12941125227263. The next prime is 12941125227313. The reversal of 12941125227281 is 18272252114921.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8848191617281 + 4092933610000 = 2974591^2 + 2023100^2 .
It is a cyclic number.
It is not a de Polignac number, because 12941125227281 - 230 = 12940051485457 is a prime.
It is a super-2 number, since 2×129411252272812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12941125229281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6470562613640 + 6470562613641.
It is an arithmetic number, because the mean of its divisors is an integer number (6470562613641).
Almost surely, 212941125227281 is an apocalyptic number.
It is an amenable number.
12941125227281 is a deficient number, since it is larger than the sum of its proper divisors (1).
12941125227281 is an equidigital number, since it uses as much as digits as its factorization.
12941125227281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 322560, while the sum is 47.
The spelling of 12941125227281 in words is "twelve trillion, nine hundred forty-one billion, one hundred twenty-five million, two hundred twenty-seven thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •