Base | Representation |
---|---|
bin | 1100001000000101100011… |
… | …00001110110100100001111 |
3 | 10111102020221211022022000001 |
4 | 12010002301201312210033 |
5 | 11443344221131240210 |
6 | 132414130430545131 |
7 | 5421364460110213 |
oct | 604026141664417 |
9 | 114366854268001 |
10 | 26666135415055 |
11 | 85510542911a4 |
12 | 2ba80aa9681a7 |
13 | 11b57b4b8a406 |
14 | 68290d962943 |
15 | 3139a9d7503a |
hex | 1840b187690f |
26666135415055 has 8 divisors (see below), whose sum is σ = 31999897882800. Its totient is φ = 21332551408896.
The previous prime is 26666135414999. The next prime is 26666135415097. The reversal of 26666135415055 is 55051453166662.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 26666135415055 - 27 = 26666135414927 is a prime.
It is a super-2 number, since 2×266661354150552 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 26666135414987 and 26666135415005.
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 44286445 + ... + 44884534.
It is an arithmetic number, because the mean of its divisors is an integer number (3999987235350).
Almost surely, 226666135415055 is an apocalyptic number.
26666135415055 is a deficient number, since it is larger than the sum of its proper divisors (5333762467745).
26666135415055 is an equidigital number, since it uses as much as digits as its factorization.
26666135415055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89230793.
The product of its (nonzero) digits is 19440000, while the sum is 55.
The spelling of 26666135415055 in words is "twenty-six trillion, six hundred sixty-six billion, one hundred thirty-five million, four hundred fifteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •