Base | Representation |
---|---|
bin | 110010011000… |
… | …1000010011101 |
3 | 1211201000221000 |
4 | 1210301002131 |
5 | 23230242021 |
6 | 2342100513 |
7 | 440345265 |
oct | 144610235 |
9 | 54630830 |
10 | 26415261 |
11 | 13a021a4 |
12 | 8a1a739 |
13 | 561b442 |
14 | 37187a5 |
15 | 24bbb26 |
hex | 193109d |
26415261 has 8 divisors (see below), whose sum is σ = 39133760. Its totient is φ = 17610156.
The previous prime is 26415241. The next prime is 26415281. The reversal of 26415261 is 16251462.
It is an interprime number because it is at equal distance from previous prime (26415241) and next prime (26415281).
It is not a de Polignac number, because 26415261 - 27 = 26415133 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 978343 = 26415261 / (2 + 6 + 4 + 1 + 5 + 2 + 6 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26415211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 489145 + ... + 489198.
It is an arithmetic number, because the mean of its divisors is an integer number (4891720).
Almost surely, 226415261 is an apocalyptic number.
It is an amenable number.
26415261 is a deficient number, since it is larger than the sum of its proper divisors (12718499).
26415261 is an equidigital number, since it uses as much as digits as its factorization.
26415261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 978352 (or 978346 counting only the distinct ones).
The product of its digits is 2880, while the sum is 27.
The square root of 26415261 is about 5139.5779009565. The cubic root of 26415261 is about 297.8184749466.
The spelling of 26415261 in words is "twenty-six million, four hundred fifteen thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •