Base | Representation |
---|---|
bin | 1001100011001… |
… | …11100101010010 |
3 | 12120202022120010 |
4 | 10301213211102 |
5 | 131002203200 |
6 | 11541055350 |
7 | 1661655330 |
oct | 461474522 |
9 | 176668503 |
10 | 80116050 |
11 | 41250413 |
12 | 229b7556 |
13 | 137a1161 |
14 | a8d6b50 |
15 | 7078150 |
hex | 4c67952 |
80116050 has 96 divisors (see below), whose sum is σ = 232735104. Its totient is φ = 17856000.
The previous prime is 80115977. The next prime is 80116051. The reversal of 80116050 is 5061108.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (80116051) 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 47 ways as a sum of consecutive naturals, for example, 42120 + ... + 43980.
It is an arithmetic number, because the mean of its divisors is an integer number (2424324).
Almost surely, 280116050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 80116050, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116367552).
80116050 is an abundant number, since it is smaller than the sum of its proper divisors (152619054).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
80116050 is a wasteful number, since it uses less digits than its factorization.
80116050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1924 (or 1919 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 21.
The square root of 80116050 is about 8950.7569512304. The cubic root of 80116050 is about 431.0951891289.
Adding to 80116050 its reverse (5061108), we get a palindrome (85177158).
The spelling of 80116050 in words is "eighty million, one hundred sixteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •