Base | Representation |
---|---|
bin | 1010111110100101110010… |
… | …0101001101011110001101 |
3 | 1120201220211201110210200211 |
4 | 2233221130211031132031 |
5 | 3040230200302011031 |
6 | 41401023113522421 |
7 | 2354026021466611 |
oct | 257513445153615 |
9 | 46656751423624 |
10 | 12070411360141 |
11 | 393403a5a0932 |
12 | 142b3b0413411 |
13 | 6973091254b4 |
14 | 2da2d50b5341 |
15 | 15dea46dabb1 |
hex | afa5c94d78d |
12070411360141 has 2 divisors, whose sum is σ = 12070411360142. Its totient is φ = 12070411360140.
The previous prime is 12070411360123. The next prime is 12070411360159. The reversal of 12070411360141 is 14106311407021.
It is a balanced prime because it is at equal distance from previous prime (12070411360123) and next prime (12070411360159).
It can be written as a sum of positive squares in only one way, i.e., 8300426054116 + 3769985306025 = 2881046^2 + 1941645^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12070411360141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12070411363141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6035205680070 + 6035205680071.
It is an arithmetic number, because the mean of its divisors is an integer number (6035205680071).
Almost surely, 212070411360141 is an apocalyptic number.
It is an amenable number.
12070411360141 is a deficient number, since it is larger than the sum of its proper divisors (1).
12070411360141 is an equidigital number, since it uses as much as digits as its factorization.
12070411360141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 12070411360141 its reverse (14106311407021), we get a palindrome (26176722767162).
The spelling of 12070411360141 in words is "twelve trillion, seventy billion, four hundred eleven million, three hundred sixty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •