Base | Representation |
---|---|
bin | 1011100011000001010000… |
… | …0001011001001001101101 |
3 | 1122221202021010200000122122 |
4 | 2320300110001121021231 |
5 | 3131003414331031321 |
6 | 43000325253522325 |
7 | 2450163065613623 |
oct | 270602401311155 |
9 | 48852233600578 |
10 | 12696259236461 |
11 | 40554a9391489 |
12 | 15107536433a5 |
13 | 711337b62978 |
14 | 31c706171513 |
15 | 1703d38ad8ab |
hex | b8c1405926d |
12696259236461 has 2 divisors, whose sum is σ = 12696259236462. Its totient is φ = 12696259236460.
The previous prime is 12696259236433. The next prime is 12696259236467. The reversal of 12696259236461 is 16463295269621.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8102391460900 + 4593867775561 = 2846470^2 + 2143331^2 .
It is a cyclic number.
It is not a de Polignac number, because 12696259236461 - 214 = 12696259220077 is a prime.
It is a super-2 number, since 2×126962592364612 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12696259236394 and 12696259236403.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12696259236467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6348129618230 + 6348129618231.
It is an arithmetic number, because the mean of its divisors is an integer number (6348129618231).
Almost surely, 212696259236461 is an apocalyptic number.
It is an amenable number.
12696259236461 is a deficient number, since it is larger than the sum of its proper divisors (1).
12696259236461 is an equidigital number, since it uses as much as digits as its factorization.
12696259236461 is an evil number, because the sum of its binary digits is even.
The product of its digits is 50388480, while the sum is 62.
The spelling of 12696259236461 in words is "twelve trillion, six hundred ninety-six billion, two hundred fifty-nine million, two hundred thirty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •