Base | Representation |
---|---|
bin | 1100010000001001111111… |
… | …01001010010000001110001 |
3 | 10112101202121201002101011001 |
4 | 12020010333221102001301 |
5 | 12012420034243243121 |
6 | 133145343114322001 |
7 | 5450411340066301 |
oct | 610047751220161 |
9 | 115352551071131 |
10 | 26943397634161 |
11 | 86486a3608138 |
12 | 3031989429301 |
13 | 12059a005a1a8 |
14 | 6920d2d53601 |
15 | 31acd626d991 |
hex | 18813fa52071 |
26943397634161 has 2 divisors, whose sum is σ = 26943397634162. Its totient is φ = 26943397634160.
The previous prime is 26943397634107. The next prime is 26943397634249. The reversal of 26943397634161 is 16143679334962.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 23101625152225 + 3841772481936 = 4806415^2 + 1960044^2 .
It is a cyclic number.
It is not a de Polignac number, because 26943397634161 - 217 = 26943397503089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 26943397634093 and 26943397634102.
It is not a weakly prime, because it can be changed into another prime (26943397632161) 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, 13471698817080 + 13471698817081.
It is an arithmetic number, because the mean of its divisors is an integer number (13471698817081).
Almost surely, 226943397634161 is an apocalyptic number.
It is an amenable number.
26943397634161 is a deficient number, since it is larger than the sum of its proper divisors (1).
26943397634161 is an equidigital number, since it uses as much as digits as its factorization.
26943397634161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 105815808, while the sum is 64.
The spelling of 26943397634161 in words is "twenty-six trillion, nine hundred forty-three billion, three hundred ninety-seven million, six hundred thirty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •