Base | Representation |
---|---|
bin | 110011011001… |
… | …0011001110101 |
3 | 1212200221210012 |
4 | 1212302121311 |
5 | 23344221031 |
6 | 2401310005 |
7 | 445013156 |
oct | 146623165 |
9 | 55627705 |
10 | 26945141 |
11 | 14234313 |
12 | 9035305 |
13 | 5775692 |
14 | 381592d |
15 | 2573b2b |
hex | 19b2675 |
26945141 has 2 divisors, whose sum is σ = 26945142. Its totient is φ = 26945140.
The previous prime is 26945131. The next prime is 26945143. The reversal of 26945141 is 14154962.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13476241 + 13468900 = 3671^2 + 3670^2 .
It is a cyclic number.
It is not a de Polignac number, because 26945141 - 222 = 22750837 is a prime.
It is a Sophie Germain prime.
Together with 26945143, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 26945098 and 26945107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (26945143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 13472570 + 13472571.
It is an arithmetic number, because the mean of its divisors is an integer number (13472571).
Almost surely, 226945141 is an apocalyptic number.
26945141 is the 3671-st centered square number.
It is an amenable number.
26945141 is a deficient number, since it is larger than the sum of its proper divisors (1).
26945141 is an equidigital number, since it uses as much as digits as its factorization.
26945141 is an evil number, because the sum of its binary digits is even.
The product of its digits is 8640, while the sum is 32.
The square root of 26945141 is about 5190.8709288519. The cubic root of 26945141 is about 299.7966807539.
The spelling of 26945141 in words is "twenty-six million, nine hundred forty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •