Base | Representation |
---|---|
bin | 1001101000111… |
… | …10000110011001 |
3 | 12122011022001200 |
4 | 10310132012121 |
5 | 131200114031 |
6 | 12005104413 |
7 | 2001221025 |
oct | 464360631 |
9 | 178138050 |
10 | 80863641 |
11 | 41711061 |
12 | 230b8109 |
13 | 139a3511 |
14 | aa4d385 |
15 | 71748e6 |
hex | 4d1e199 |
80863641 has 24 divisors (see below), whose sum is σ = 120182400. Its totient is φ = 52367136.
The previous prime is 80863621. The next prime is 80863661. The reversal of 80863641 is 14636808.
It is a happy number.
80863641 is a `hidden beast` number, since 8 + 0 + 8 + 6 + 3 + 641 = 666.
It is an interprime number because it is at equal distance from previous prime (80863621) and next prime (80863661).
It is not a de Polignac number, because 80863641 - 25 = 80863609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 80863596 and 80863605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80863621) 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 23 ways as a sum of consecutive naturals, for example, 62386 + ... + 63668.
It is an arithmetic number, because the mean of its divisors is an integer number (5007600).
Almost surely, 280863641 is an apocalyptic number.
It is an amenable number.
80863641 is a deficient number, since it is larger than the sum of its proper divisors (39318759).
80863641 is a wasteful number, since it uses less digits than its factorization.
80863641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1485 (or 1482 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 80863641 is about 8992.4213090802. The cubic root of 80863641 is about 432.4319400182.
The spelling of 80863641 in words is "eighty million, eight hundred sixty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •