Base | Representation |
---|---|
bin | 1001000110100… |
… | …11100100000000 |
3 | 12022200200202111 |
4 | 10203103210000 |
5 | 124022122112 |
6 | 11324425104 |
7 | 1615040443 |
oct | 443234400 |
9 | 168620674 |
10 | 76364032 |
11 | 3a118478 |
12 | 216a8194 |
13 | 12a89424 |
14 | a1db65a |
15 | 6a865a7 |
hex | 48d3900 |
76364032 has 36 divisors (see below), whose sum is σ = 153073116. Its totient is φ = 38021120.
The previous prime is 76364011. The next prime is 76364039. The reversal of 76364032 is 23046367.
It can be written as a sum of positive squares in 2 ways, for example, as 22429696 + 53934336 = 4736^2 + 7344^2 .
It is a junction number, because it is equal to n+sod(n) for n = 76363985 and 76364003.
It is not an unprimeable number, because it can be changed into a prime (76364039) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 80682 + ... + 81622.
It is an arithmetic number, because the mean of its divisors is an integer number (4252031).
Almost surely, 276364032 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 76364032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76536558).
76364032 is an abundant number, since it is smaller than the sum of its proper divisors (76709084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76364032 is an equidigital number, since it uses as much as digits as its factorization.
76364032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1274 (or 1260 counting only the distinct ones).
The product of its (nonzero) digits is 18144, while the sum is 31.
The square root of 76364032 is about 8738.6516122340. The cubic root of 76364032 is about 424.2575864497.
The spelling of 76364032 in words is "seventy-six million, three hundred sixty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •