Base | Representation |
---|---|
bin | 110001101010… |
… | …1100011010101 |
3 | 1210222222220012 |
4 | 1203111203111 |
5 | 23131244113 |
6 | 2330050005 |
7 | 434224631 |
oct | 143254325 |
9 | 53888805 |
10 | 26040533 |
11 | 13776702 |
12 | 8879905 |
13 | 55199cc |
14 | 365bdc1 |
15 | 2445aa8 |
hex | 18d58d5 |
26040533 has 4 divisors (see below), whose sum is σ = 26370240. Its totient is φ = 25710828.
The previous prime is 26040529. The next prime is 26040541. The reversal of 26040533 is 33504062.
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 a cyclic number.
It is not a de Polignac number, because 26040533 - 22 = 26040529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 26040499 and 26040508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (26040233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 164735 + ... + 164892.
It is an arithmetic number, because the mean of its divisors is an integer number (6592560).
Almost surely, 226040533 is an apocalyptic number.
It is an amenable number.
26040533 is a deficient number, since it is larger than the sum of its proper divisors (329707).
26040533 is an equidigital number, since it uses as much as digits as its factorization.
26040533 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329706.
The product of its (nonzero) digits is 2160, while the sum is 23.
The square root of 26040533 is about 5102.9925533945. The cubic root of 26040533 is about 296.4034741583.
Adding to 26040533 its reverse (33504062), we get a palindrome (59544595).
The spelling of 26040533 in words is "twenty-six million, forty thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •