Base | Representation |
---|---|
bin | 1011111111000000011101… |
… | …11101111001011111101001 |
3 | 10110022102201110011100000021 |
4 | 11333200032331321133221 |
5 | 11423241320112414221 |
6 | 132014534434440441 |
7 | 5360011624406443 |
oct | 577401675713751 |
9 | 113272643140007 |
10 | 26354170435561 |
11 | 84408171827a1 |
12 | 2b57746433121 |
13 | 11922592391a7 |
14 | 67179771b493 |
15 | 30a7ec062041 |
hex | 17f80ef797e9 |
26354170435561 has 2 divisors, whose sum is σ = 26354170435562. Its totient is φ = 26354170435560.
The previous prime is 26354170435553. The next prime is 26354170435589. The reversal of 26354170435561 is 16553407145362.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23895907062336 + 2458263373225 = 4888344^2 + 1567885^2 .
It is a cyclic number.
It is not a de Polignac number, because 26354170435561 - 23 = 26354170435553 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26354170435499 and 26354170435508.
It is not a weakly prime, because it can be changed into another prime (26354170435261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13177085217780 + 13177085217781.
It is an arithmetic number, because the mean of its divisors is an integer number (13177085217781).
Almost surely, 226354170435561 is an apocalyptic number.
It is an amenable number.
26354170435561 is a deficient number, since it is larger than the sum of its proper divisors (1).
26354170435561 is an equidigital number, since it uses as much as digits as its factorization.
26354170435561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072000, while the sum is 52.
The spelling of 26354170435561 in words is "twenty-six trillion, three hundred fifty-four billion, one hundred seventy million, four hundred thirty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •