Base | Representation |
---|---|
bin | 1001101001011… |
… | …11000100011100 |
3 | 12122021211102000 |
4 | 10310233010130 |
5 | 131204330043 |
6 | 12010402300 |
7 | 2001630462 |
oct | 464570434 |
9 | 178254360 |
10 | 80933148 |
11 | 417592aa |
12 | 23130390 |
13 | 139c904a |
14 | aa6a832 |
15 | 718a2d3 |
hex | 4d2f11c |
80933148 has 48 divisors (see below), whose sum is σ = 210420000. Its totient is φ = 26901504.
The previous prime is 80933147. The next prime is 80933183. The reversal of 80933148 is 84133908.
80933148 is digitally balanced in base 9, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
80933148 is strictly pandigital in base 9.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (80933147) 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 15 ways as a sum of consecutive naturals, for example, 47658 + ... + 49326.
It is an arithmetic number, because the mean of its divisors is an integer number (4383750).
Almost surely, 280933148 is an apocalyptic number.
It is an amenable number.
80933148 is an abundant number, since it is smaller than the sum of its proper divisors (129486852).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80933148 is a wasteful number, since it uses less digits than its factorization.
80933148 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2131 (or 2123 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 80933148 is about 8996.2852333616. The cubic root of 80933148 is about 432.5558046652. Note that the first 3 decimals are identical.
The spelling of 80933148 in words is "eighty million, nine hundred thirty-three thousand, one hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •