Base | Representation |
---|---|
bin | 1001101000101… |
… | …00110001011101 |
3 | 12122002100122201 |
4 | 10310110301131 |
5 | 131142403222 |
6 | 12004211501 |
7 | 2001001450 |
oct | 464246135 |
9 | 178070581 |
10 | 80825437 |
11 | 41695390 |
12 | 23099b91 |
13 | 1398c004 |
14 | aa3d497 |
15 | 7168427 |
hex | 4d14c5d |
80825437 has 8 divisors (see below), whose sum is σ = 100769472. Its totient is φ = 62980800.
The previous prime is 80825431. The next prime is 80825443. The reversal of 80825437 is 73452808.
It is an interprime number because it is at equal distance from previous prime (80825431) and next prime (80825443).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 80825437 - 215 = 80792669 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 80825396 and 80825405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80825431) 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 7 ways as a sum of consecutive naturals, for example, 524764 + ... + 524917.
It is an arithmetic number, because the mean of its divisors is an integer number (12596184).
Almost surely, 280825437 is an apocalyptic number.
It is an amenable number.
80825437 is a deficient number, since it is larger than the sum of its proper divisors (19944035).
80825437 is a wasteful number, since it uses less digits than its factorization.
80825437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049699.
The product of its (nonzero) digits is 53760, while the sum is 37.
The square root of 80825437 is about 8990.2968249107. The cubic root of 80825437 is about 432.3638285158.
The spelling of 80825437 in words is "eighty million, eight hundred twenty-five thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.304 sec. • engine limits •