Base | Representation |
---|---|
bin | 1001000111000… |
… | …11111100010100 |
3 | 12022211002210101 |
4 | 10203203330110 |
5 | 124031243444 |
6 | 11330103444 |
7 | 1615440160 |
oct | 443437424 |
9 | 168732711 |
10 | 76431124 |
11 | 3a163920 |
12 | 2171ab84 |
13 | 12ab0b23 |
14 | a217ca0 |
15 | 6a9b3d4 |
hex | 48e3f14 |
76431124 has 96 divisors (see below), whose sum is σ = 177408000. Its totient is φ = 27941760.
The previous prime is 76431119. The next prime is 76431143. The reversal of 76431124 is 42113467.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 76431092 and 76431101.
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 31 ways as a sum of consecutive naturals, for example, 383977 + ... + 384175.
It is an arithmetic number, because the mean of its divisors is an integer number (1848000).
Almost surely, 276431124 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 76431124, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88704000).
76431124 is an abundant number, since it is smaller than the sum of its proper divisors (100976876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76431124 is a wasteful number, since it uses less digits than its factorization.
76431124 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293 (or 291 counting only the distinct ones).
The product of its digits is 4032, while the sum is 28.
The square root of 76431124 is about 8742.4895767739. The cubic root of 76431124 is about 424.3817983212.
The spelling of 76431124 in words is "seventy-six million, four hundred thirty-one thousand, one hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •