Base | Representation |
---|---|
bin | 110010011001… |
… | …0100001001101 |
3 | 1211201100020121 |
4 | 1210302201031 |
5 | 23230440300 |
6 | 2342144541 |
7 | 440402050 |
oct | 144624115 |
9 | 54640217 |
10 | 26421325 |
11 | 13a06807 |
12 | 8a22151 |
13 | 5621128 |
14 | 371aa97 |
15 | 24bd81a |
hex | 193284d |
26421325 has 12 divisors (see below), whose sum is σ = 37443040. Its totient is φ = 18117360.
The previous prime is 26421299. The next prime is 26421337. The reversal of 26421325 is 52312462.
It is not a de Polignac number, because 26421325 - 221 = 24324173 is a prime.
It is a super-3 number, since 3×264213253 (a number of 23 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a self number, because there is not a number n which added to its sum of digits gives 26421325.
It is a congruent number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 75315 + ... + 75664.
Almost surely, 226421325 is an apocalyptic number.
26421325 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
26421325 is a deficient number, since it is larger than the sum of its proper divisors (11021715).
26421325 is a wasteful number, since it uses less digits than its factorization.
26421325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150996 (or 150991 counting only the distinct ones).
The product of its digits is 2880, while the sum is 25.
The square root of 26421325 is about 5140.1677988175. The cubic root of 26421325 is about 297.8412626961.
Adding to 26421325 its reverse (52312462), we get a palindrome (78733787).
The spelling of 26421325 in words is "twenty-six million, four hundred twenty-one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •