Base | Representation |
---|---|
bin | 1001001010010… |
… | …11110001111000 |
3 | 12100121201012211 |
4 | 10211023301320 |
5 | 124133401230 |
6 | 11343144504 |
7 | 1622161153 |
oct | 445136170 |
9 | 170551184 |
10 | 76856440 |
11 | 3a424421 |
12 | 218a5134 |
13 | 12bcc5ab |
14 | a2c8c9a |
15 | 6b3242a |
hex | 494bc78 |
76856440 has 32 divisors (see below), whose sum is σ = 178508160. Its totient is φ = 29750400.
The previous prime is 76856411. The next prime is 76856441. The reversal of 76856440 is 4465867.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 76856393 and 76856402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (76856441) 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 7 ways as a sum of consecutive naturals, for example, 29751 + ... + 32230.
It is an arithmetic number, because the mean of its divisors is an integer number (5578380).
Almost surely, 276856440 is an apocalyptic number.
It is an amenable number.
76856440 is an abundant number, since it is smaller than the sum of its proper divisors (101651720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76856440 is a wasteful number, since it uses less digits than its factorization.
76856440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 62023 (or 62019 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 40.
The square root of 76856440 is about 8766.7804808835. The cubic root of 76856440 is about 425.1675279569.
The spelling of 76856440 in words is "seventy-six million, eight hundred fifty-six thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •