Base | Representation |
---|---|
bin | 1011111000001100101111… |
… | …00011001011100110010101 |
3 | 10102111001220100100100102201 |
4 | 11330012113203023212111 |
5 | 11410423222102143031 |
6 | 131315245542004501 |
7 | 5334060602503363 |
oct | 574062743134625 |
9 | 112431810310381 |
10 | 26120238709141 |
11 | 8360592886295 |
12 | 2b1a33b116731 |
13 | 11761881192b5 |
14 | 664324d70633 |
15 | 3046a9c27d61 |
hex | 17c1978cb995 |
26120238709141 has 2 divisors, whose sum is σ = 26120238709142. Its totient is φ = 26120238709140.
The previous prime is 26120238709139. The next prime is 26120238709157. The reversal of 26120238709141 is 14190783202162.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 22001587642225 + 4118651066916 = 4690585^2 + 2029446^2 .
It is a cyclic number.
It is not a de Polignac number, because 26120238709141 - 21 = 26120238709139 is a prime.
Together with 26120238709139, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 26120238709091 and 26120238709100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (26120238709121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13060119354570 + 13060119354571.
It is an arithmetic number, because the mean of its divisors is an integer number (13060119354571).
Almost surely, 226120238709141 is an apocalyptic number.
It is an amenable number.
26120238709141 is a deficient number, since it is larger than the sum of its proper divisors (1).
26120238709141 is an equidigital number, since it uses as much as digits as its factorization.
26120238709141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 290304, while the sum is 46.
The spelling of 26120238709141 in words is "twenty-six trillion, one hundred twenty billion, two hundred thirty-eight million, seven hundred nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •