Base | Representation |
---|---|
bin | 1001001010000… |
… | …11000111111100 |
3 | 12100112220120210 |
4 | 10211003013330 |
5 | 124131232423 |
6 | 11342312420 |
7 | 1621652616 |
oct | 445030774 |
9 | 170486523 |
10 | 76820988 |
11 | 3a3aa822 |
12 | 21888710 |
13 | 12bb940a |
14 | a2b9db6 |
15 | 6b26b93 |
hex | 49431fc |
76820988 has 12 divisors (see below), whose sum is σ = 179249000. Its totient is φ = 25606992.
The previous prime is 76820981. The next prime is 76821001. The reversal of 76820988 is 88902867.
It is a happy number.
76820988 is digitally balanced in base 9, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×768209882 = 11802928394592288, which contains 22 as substring.
76820988 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 (76820981) 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 3 ways as a sum of consecutive naturals, for example, 3200863 + ... + 3200886.
Almost surely, 276820988 is an apocalyptic number.
It is an amenable number.
76820988 is an abundant number, since it is smaller than the sum of its proper divisors (102428012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76820988 is a wasteful number, since it uses less digits than its factorization.
76820988 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6401756 (or 6401754 counting only the distinct ones).
The product of its (nonzero) digits is 387072, while the sum is 48.
The square root of 76820988 is about 8764.7582967244. The cubic root of 76820988 is about 425.1021447680.
The spelling of 76820988 in words is "seventy-six million, eight hundred twenty thousand, nine hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •