Base | Representation |
---|---|
bin | 110010010110… |
… | …1111001101101 |
3 | 1211200101022011 |
4 | 1210231321231 |
5 | 23224334123 |
6 | 2341521221 |
7 | 440262652 |
oct | 144557155 |
9 | 54611264 |
10 | 26402413 |
11 | 139a3584 |
12 | 8a13211 |
13 | 561563b |
14 | 3713c29 |
15 | 24b7e0d |
hex | 192de6d |
26402413 has 4 divisors (see below), whose sum is σ = 27550368. Its totient is φ = 25254460.
The previous prime is 26402407. The next prime is 26402417. The reversal of 26402413 is 31420462.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 31420462 = 2 ⋅15710231.
It is a de Polignac number, because none of the positive numbers 2k-26402413 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26402417) 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, 573943 + ... + 573988.
It is an arithmetic number, because the mean of its divisors is an integer number (6887592).
Almost surely, 226402413 is an apocalyptic number.
26402413 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
26402413 is a deficient number, since it is larger than the sum of its proper divisors (1147955).
26402413 is a wasteful number, since it uses less digits than its factorization.
26402413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1147954.
The product of its (nonzero) digits is 1152, while the sum is 22.
The square root of 26402413 is about 5138.3278408447. The cubic root of 26402413 is about 297.7701822533.
Adding to 26402413 its reverse (31420462), we get a palindrome (57822875).
The spelling of 26402413 in words is "twenty-six million, four hundred two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •