Base | Representation |
---|---|
bin | 1001000100110… |
… | …01011110000000 |
3 | 12022020121100110 |
4 | 10202121132000 |
5 | 123442013310 |
6 | 11315351320 |
7 | 1613026632 |
oct | 442313600 |
9 | 168217313 |
10 | 76126080 |
11 | 39a75718 |
12 | 215b2540 |
13 | 12a05024 |
14 | a178a52 |
15 | 6a3ad20 |
hex | 4899780 |
76126080 has 128 divisors (see below), whose sum is σ = 250675200. Its totient is φ = 19630080.
The previous prime is 76126031. The next prime is 76126081. The reversal of 76126080 is 8062167.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (76126081) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 58881 + ... + 60159.
It is an arithmetic number, because the mean of its divisors is an integer number (1958400).
Almost surely, 276126080 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 76126080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125337600).
76126080 is an abundant number, since it is smaller than the sum of its proper divisors (174549120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76126080 is a wasteful number, since it uses less digits than its factorization.
76126080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1332 (or 1320 counting only the distinct ones).
The product of its (nonzero) digits is 4032, while the sum is 30.
The square root of 76126080 is about 8725.0260744596. The cubic root of 76126080 is about 423.8164626306.
The spelling of 76126080 in words is "seventy-six million, one hundred twenty-six thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •