Base | Representation |
---|---|
bin | 110001110110… |
… | …0111101011101 |
3 | 1211011212102022 |
4 | 1203230331131 |
5 | 23142331123 |
6 | 2332105525 |
7 | 435104312 |
oct | 143547535 |
9 | 54155368 |
10 | 26136413 |
11 | 13831746 |
12 | 89052a5 |
13 | 5551544 |
14 | 3684d09 |
15 | 24641c8 |
hex | 18ecf5d |
26136413 has 4 divisors (see below), whose sum is σ = 26163228. Its totient is φ = 26109600.
The previous prime is 26136403. The next prime is 26136427. The reversal of 26136413 is 31463162.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 31463162 = 2 ⋅15731581.
It can be written as a sum of positive squares in 2 ways, for example, as 4439449 + 21696964 = 2107^2 + 4658^2 .
It is a cyclic number.
It is not a de Polignac number, because 26136413 - 212 = 26132317 is a prime.
It is a super-2 number, since 2×261364132 = 1366224169013138, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26136403) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 11888 + ... + 13913.
It is an arithmetic number, because the mean of its divisors is an integer number (6540807).
Almost surely, 226136413 is an apocalyptic number.
It is an amenable number.
26136413 is a deficient number, since it is larger than the sum of its proper divisors (26815).
26136413 is a wasteful number, since it uses less digits than its factorization.
26136413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26814.
The product of its digits is 2592, while the sum is 26.
The square root of 26136413 is about 5112.3784093120. The cubic root of 26136413 is about 296.7668097441.
Adding to 26136413 its reverse (31463162), we get a palindrome (57599575).
The spelling of 26136413 in words is "twenty-six million, one hundred thirty-six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •