Base | Representation |
---|---|
bin | 1011010101010101010011… |
… | …1110000000001010101001 |
3 | 1122010021100021101000020102 |
4 | 2311111110332000022221 |
5 | 3113130341132243244 |
6 | 42300321225235145 |
7 | 2424200211340466 |
oct | 265252476001251 |
9 | 48107307330212 |
10 | 12461125665449 |
11 | 3a7480863938a |
12 | 1493071932ab5 |
13 | 6c5104a53b26 |
14 | 31119bd3466d |
15 | 169220cc254e |
hex | b5554f802a9 |
12461125665449 has 2 divisors, whose sum is σ = 12461125665450. Its totient is φ = 12461125665448.
The previous prime is 12461125665353. The next prime is 12461125665481. The reversal of 12461125665449 is 94456652116421.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10490732323600 + 1970393341849 = 3238940^2 + 1403707^2 .
It is a cyclic number.
It is not a de Polignac number, because 12461125665449 - 216 = 12461125599913 is a prime.
It is a super-2 number, since 2×124611256654492 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12461125665394 and 12461125665403.
It is not a weakly prime, because it can be changed into another prime (12461125665749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6230562832724 + 6230562832725.
It is an arithmetic number, because the mean of its divisors is an integer number (6230562832725).
Almost surely, 212461125665449 is an apocalyptic number.
It is an amenable number.
12461125665449 is a deficient number, since it is larger than the sum of its proper divisors (1).
12461125665449 is an equidigital number, since it uses as much as digits as its factorization.
12461125665449 is an evil number, because the sum of its binary digits is even.
The product of its digits is 12441600, while the sum is 56.
The spelling of 12461125665449 in words is "twelve trillion, four hundred sixty-one billion, one hundred twenty-five million, six hundred sixty-five thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •