Base | Representation |
---|---|
bin | 1001000110010… |
… | …11100000101100 |
3 | 12022122000112000 |
4 | 10203023200230 |
5 | 124020043202 |
6 | 11324012300 |
7 | 1614542340 |
oct | 443134054 |
9 | 168560460 |
10 | 76331052 |
11 | 3a0a5716 |
12 | 21691090 |
13 | 12a77405 |
14 | a1cd620 |
15 | 6a7b91c |
hex | 48cb82c |
76331052 has 96 divisors (see below), whose sum is σ = 233533440. Its totient is φ = 21098880.
The previous prime is 76331051. The next prime is 76331131. The reversal of 76331052 is 25013367.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (76331051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21808 + ... + 25064.
It is an arithmetic number, because the mean of its divisors is an integer number (2432640).
Almost surely, 276331052 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 76331052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (116766720).
76331052 is an abundant number, since it is smaller than the sum of its proper divisors (157202388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76331052 is a wasteful number, since it uses less digits than its factorization.
76331052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3308 (or 3300 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The square root of 76331052 is about 8736.7643896353. The cubic root of 76331052 is about 424.1965017147.
The spelling of 76331052 in words is "seventy-six million, three hundred thirty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •