Base | Representation |
---|---|
bin | 1100000111100011110111… |
… | …01010011001001111000001 |
3 | 10111100112021112211020202102 |
4 | 12003301323222121033001 |
5 | 11443100202231042421 |
6 | 132401540200400145 |
7 | 5420154365050214 |
oct | 603617352311701 |
9 | 114315245736672 |
10 | 26648051815361 |
11 | 854441459a089 |
12 | 2ba46a2776055 |
13 | 11b3b92539172 |
14 | 681ab5db377b |
15 | 31329c4a660b |
hex | 183c7ba993c1 |
26648051815361 has 2 divisors, whose sum is σ = 26648051815362. Its totient is φ = 26648051815360.
The previous prime is 26648051815331. The next prime is 26648051815397. The reversal of 26648051815361 is 16351815084662.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 25694608930225 + 953442885136 = 5068985^2 + 976444^2 .
It is a cyclic number.
It is not a de Polignac number, because 26648051815361 - 210 = 26648051814337 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26648051815297 and 26648051815306.
It is not a weakly prime, because it can be changed into another prime (26648051815331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13324025907680 + 13324025907681.
It is an arithmetic number, because the mean of its divisors is an integer number (13324025907681).
Almost surely, 226648051815361 is an apocalyptic number.
It is an amenable number.
26648051815361 is a deficient number, since it is larger than the sum of its proper divisors (1).
26648051815361 is an equidigital number, since it uses as much as digits as its factorization.
26648051815361 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8294400, while the sum is 56.
The spelling of 26648051815361 in words is "twenty-six trillion, six hundred forty-eight billion, fifty-one million, eight hundred fifteen thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.023 sec. • engine limits •