Base | Representation |
---|---|
bin | 1001000111000… |
… | …10100001111000 |
3 | 12022210210212000 |
4 | 10203202201320 |
5 | 124031102321 |
6 | 11330021000 |
7 | 1615414251 |
oct | 443424170 |
9 | 168723760 |
10 | 76425336 |
11 | 3a15a539 |
12 | 21717760 |
13 | 12aab2c0 |
14 | a215b28 |
15 | 6a99826 |
hex | 48e2878 |
76425336 has 128 divisors (see below), whose sum is σ = 242222400. Its totient is φ = 22118400.
The previous prime is 76425329. The next prime is 76425341. The reversal of 76425336 is 63352467.
76425336 is a `hidden beast` number, since 7 + 642 + 5 + 3 + 3 + 6 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 76425336.
It is a congruent number.
It is an unprimeable number.
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, 46936 + ... + 48536.
Almost surely, 276425336 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 76425336, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121111200).
76425336 is an abundant number, since it is smaller than the sum of its proper divisors (165797064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
76425336 is a wasteful number, since it uses less digits than its factorization.
76425336 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1646 (or 1636 counting only the distinct ones).
The product of its digits is 90720, while the sum is 36.
The square root of 76425336 is about 8742.1585435177. The cubic root of 76425336 is about 424.3710854783.
The spelling of 76425336 in words is "seventy-six million, four hundred twenty-five thousand, three hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •