Base | Representation |
---|---|
bin | 1001001001000… |
… | …01111011111000 |
3 | 12100022000002222 |
4 | 10210201323320 |
5 | 124112410143 |
6 | 11335343212 |
7 | 1620545366 |
oct | 444417370 |
9 | 170260088 |
10 | 76685048 |
11 | 3a317680 |
12 | 21821b08 |
13 | 12b6c58b |
14 | a282636 |
15 | 6aeb768 |
hex | 4921ef8 |
76685048 has 64 divisors (see below), whose sum is σ = 164160000. Its totient is φ = 33264000.
The previous prime is 76685029. The next prime is 76685069. The reversal of 76685048 is 84058667.
It is a Cunningham number, because it is equal to 87572-1.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is an unprimeable number.
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, 385253 + ... + 385451.
It is an arithmetic number, because the mean of its divisors is an integer number (2565000).
Almost surely, 276685048 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 76685048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82080000).
76685048 is an abundant number, since it is smaller than the sum of its proper divisors (87474952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76685048 is a wasteful number, since it uses less digits than its factorization.
76685048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396 (or 392 counting only the distinct ones).
The product of its (nonzero) digits is 322560, while the sum is 44.
The square root of 76685048 is about 8756.9999429028. Note that the first 4 decimals coincide. The cubic root of 76685048 is about 424.8512475959.
The spelling of 76685048 in words is "seventy-six million, six hundred eighty-five thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •