Base | Representation |
---|---|
bin | 11000110001110010… |
… | …101001001101001101 |
3 | 2112200011022022222001 |
4 | 120301302221031031 |
5 | 413441410211331 |
6 | 20120000552301 |
7 | 1631205104611 |
oct | 306162511515 |
9 | 75604268861 |
10 | 26605163341 |
11 | 10312a14aa9 |
12 | 51a6022691 |
13 | 267cc59503 |
14 | 1405623341 |
15 | a5aa91561 |
hex | 631ca934d |
26605163341 has 2 divisors, whose sum is σ = 26605163342. Its totient is φ = 26605163340.
The previous prime is 26605163293. The next prime is 26605163413. The reversal of 26605163341 is 14336150662.
Together with next prime (26605163413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 16413453225 + 10191710116 = 128115^2 + 100954^2 .
It is a cyclic number.
It is not a de Polignac number, because 26605163341 - 27 = 26605163213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 26605163341.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (26605163141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13302581670 + 13302581671.
It is an arithmetic number, because the mean of its divisors is an integer number (13302581671).
Almost surely, 226605163341 is an apocalyptic number.
It is an amenable number.
26605163341 is a deficient number, since it is larger than the sum of its proper divisors (1).
26605163341 is an equidigital number, since it uses as much as digits as its factorization.
26605163341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 77760, while the sum is 37.
The spelling of 26605163341 in words is "twenty-six billion, six hundred five million, one hundred sixty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.046 sec. • engine limits •