Base | Representation |
---|---|
bin | 110001101010… |
… | …1100011000001 |
3 | 1210222222212110 |
4 | 1203111203001 |
5 | 23131244023 |
6 | 2330045533 |
7 | 434224602 |
oct | 143254301 |
9 | 53888773 |
10 | 26040513 |
11 | 13776694 |
12 | 88798a9 |
13 | 55199b5 |
14 | 365bda9 |
15 | 2445a93 |
hex | 18d58c1 |
26040513 has 4 divisors (see below), whose sum is σ = 34720688. Its totient is φ = 17360340.
The previous prime is 26040467. The next prime is 26040517. The reversal of 26040513 is 31504062.
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.
It is not a de Polignac number, because 26040513 - 26 = 26040449 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 26040513.
It is not an unprimeable number, because it can be changed into a prime (26040517) 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 3 ways as a sum of consecutive naturals, for example, 4340083 + ... + 4340088.
It is an arithmetic number, because the mean of its divisors is an integer number (8680172).
Almost surely, 226040513 is an apocalyptic number.
It is an amenable number.
26040513 is a deficient number, since it is larger than the sum of its proper divisors (8680175).
26040513 is an equidigital number, since it uses as much as digits as its factorization.
26040513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8680174.
The product of its (nonzero) digits is 720, while the sum is 21.
The square root of 26040513 is about 5102.9905937597. The cubic root of 26040513 is about 296.4033982757.
Adding to 26040513 its reverse (31504062), we get a palindrome (57544575).
The spelling of 26040513 in words is "twenty-six million, forty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •