Base | Representation |
---|---|
bin | 1100001000000101100011… |
… | …00001110110100100111001 |
3 | 10111102020221211022022001121 |
4 | 12010002301201312210321 |
5 | 11443344221131240342 |
6 | 132414130430545241 |
7 | 5421364460110303 |
oct | 604026141664471 |
9 | 114366854268047 |
10 | 26666135415097 |
11 | 8551054291232 |
12 | 2ba80aa968221 |
13 | 11b57b4b8a439 |
14 | 68290d962973 |
15 | 3139a9d75067 |
hex | 1840b1876939 |
26666135415097 has 2 divisors, whose sum is σ = 26666135415098. Its totient is φ = 26666135415096.
The previous prime is 26666135414999. The next prime is 26666135415163. The reversal of 26666135415097 is 79051453166662.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20123083487376 + 6543051927721 = 4485876^2 + 2557939^2 .
It is a cyclic number.
It is not a de Polignac number, because 26666135415097 - 223 = 26666127026489 is a prime.
It is a super-2 number, since 2×266661354150972 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (26666105415097) 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, 13333067707548 + 13333067707549.
It is an arithmetic number, because the mean of its divisors is an integer number (13333067707549).
Almost surely, 226666135415097 is an apocalyptic number.
It is an amenable number.
26666135415097 is a deficient number, since it is larger than the sum of its proper divisors (1).
26666135415097 is an equidigital number, since it uses as much as digits as its factorization.
26666135415097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48988800, while the sum is 61.
The spelling of 26666135415097 in words is "twenty-six trillion, six hundred sixty-six billion, one hundred thirty-five million, four hundred fifteen thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •