Base | Representation |
---|---|
bin | 1001101001011… |
… | …01111111111101 |
3 | 12122021121101200 |
4 | 10310231333331 |
5 | 131204210030 |
6 | 12010330113 |
7 | 2001611631 |
oct | 464557775 |
9 | 178247350 |
10 | 80928765 |
11 | 41755a85 |
12 | 23129939 |
13 | 139c7058 |
14 | aa68dc1 |
15 | 7188d60 |
hex | 4d2dffd |
80928765 has 24 divisors (see below), whose sum is σ = 140613408. Its totient is φ = 43058400.
The previous prime is 80928737. The next prime is 80928767. The reversal of 80928765 is 56782908.
It is not a de Polignac number, because 80928765 - 27 = 80928637 is a prime.
It is a Smith number, since the sum of its digits (45) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 80928765.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80928767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19090 + ... + 22940.
It is an arithmetic number, because the mean of its divisors is an integer number (5858892).
Almost surely, 280928765 is an apocalyptic number.
It is an amenable number.
80928765 is a deficient number, since it is larger than the sum of its proper divisors (59684643).
80928765 is a wasteful number, since it uses less digits than its factorization.
80928765 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4329 (or 4326 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 45.
The square root of 80928765 is about 8996.0416295168. The cubic root of 80928765 is about 432.5479960546.
The spelling of 80928765 in words is "eighty million, nine hundred twenty-eight thousand, seven hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •