Base | Representation |
---|---|
bin | 1001000110011… |
… | …11011010101000 |
3 | 12022122211110110 |
4 | 10203033122220 |
5 | 124021101143 |
6 | 11324214320 |
7 | 1614640101 |
oct | 443173250 |
9 | 168584413 |
10 | 76347048 |
11 | 3a106738 |
12 | 2169a3a0 |
13 | 12a8178b |
14 | a1d53a8 |
15 | 6a81533 |
hex | 48cf6a8 |
76347048 has 64 divisors (see below), whose sum is σ = 199411200. Its totient is φ = 24330240.
The previous prime is 76347023. The next prime is 76347049. The reversal of 76347048 is 84074367.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 76346997 and 76347015.
It is not an unprimeable number, because it can be changed into a prime (76347049) 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 15 ways as a sum of consecutive naturals, for example, 65640 + ... + 66792.
It is an arithmetic number, because the mean of its divisors is an integer number (3115800).
Almost surely, 276347048 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 76347048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (99705600).
76347048 is an abundant number, since it is smaller than the sum of its proper divisors (123064152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76347048 is a wasteful number, since it uses less digits than its factorization.
76347048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1282 (or 1278 counting only the distinct ones).
The product of its (nonzero) digits is 112896, while the sum is 39.
The square root of 76347048 is about 8737.6797835581. The cubic root of 76347048 is about 424.2261313046.
The spelling of 76347048 in words is "seventy-six million, three hundred forty-seven thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •