Base | Representation |
---|---|
bin | 1001001010000… |
… | …10000101100100 |
3 | 12100112200202110 |
4 | 10211002011210 |
5 | 124131113430 |
6 | 11342241020 |
7 | 1621634340 |
oct | 445020544 |
9 | 170480673 |
10 | 76816740 |
11 | 3a3a7610 |
12 | 21886170 |
13 | 12bb74c0 |
14 | a2b8620 |
15 | 6b257b0 |
hex | 4942164 |
76816740 has 192 divisors, whose sum is σ = 289013760. Its totient is φ = 14722560.
The previous prime is 76816703. The next prime is 76816741. The reversal of 76816740 is 4761867.
76816740 is nontrivially palindromic in base 8.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (76816741) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 59421 + ... + 60699.
It is an arithmetic number, because the mean of its divisors is an integer number (1505280).
Almost surely, 276816740 is an apocalyptic number.
76816740 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 76816740, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (144506880).
76816740 is an abundant number, since it is smaller than the sum of its proper divisors (212197020).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76816740 is a wasteful number, since it uses less digits than its factorization.
76816740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1322 (or 1320 counting only the distinct ones).
The product of its (nonzero) digits is 56448, while the sum is 39.
The square root of 76816740 is about 8764.5159592530. The cubic root of 76816740 is about 425.0943089441.
The spelling of 76816740 in words is "seventy-six million, eight hundred sixteen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •