Base | Representation |
---|---|
bin | 1001000111101… |
… | …01111010100000 |
3 | 12022221211202202 |
4 | 10203311322200 |
5 | 124041122421 |
6 | 11331432332 |
7 | 1616164610 |
oct | 443657240 |
9 | 168854682 |
10 | 76504736 |
11 | 3a204160 |
12 | 217556a8 |
13 | 12b08499 |
14 | a236a40 |
15 | 6ab310b |
hex | 48f5ea0 |
76504736 has 96 divisors (see below), whose sum is σ = 191237760. Its totient is φ = 29260800.
The previous prime is 76504733. The next prime is 76504759. The reversal of 76504736 is 63740567.
It is a self number, because there is not a number n which added to its sum of digits gives 76504736.
It is not an unprimeable number, because it can be changed into a prime (76504733) 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, 150050 + ... + 150558.
It is an arithmetic number, because the mean of its divisors is an integer number (1992060).
Almost surely, 276504736 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 76504736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (95618880).
76504736 is an abundant number, since it is smaller than the sum of its proper divisors (114733024).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76504736 is a wasteful number, since it uses less digits than its factorization.
76504736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598 (or 590 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 38.
The square root of 76504736 is about 8746.6985771776. The cubic root of 76504736 is about 424.5179975009.
The spelling of 76504736 in words is "seventy-six million, five hundred four thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •