Base | Representation |
---|---|
bin | 1000110101001… |
… | …01001010011100 |
3 | 12011101111022020 |
4 | 10122211022130 |
5 | 122430424303 |
6 | 11203420140 |
7 | 1556433300 |
oct | 432451234 |
9 | 164344266 |
10 | 74076828 |
11 | 388a6021 |
12 | 20984650 |
13 | 12468357 |
14 | 9ba3d00 |
15 | 6783a53 |
hex | 46a529c |
74076828 has 72 divisors (see below), whose sum is σ = 204945552. Its totient is φ = 20756736.
The previous prime is 74076797. The next prime is 74076829. The reversal of 74076828 is 82867047.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a self number, because there is not a number n which added to its sum of digits gives 74076828.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (74076829) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 29976 + ... + 32352.
It is an arithmetic number, because the mean of its divisors is an integer number (2846466).
Almost surely, 274076828 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 74076828, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102472776).
74076828 is an abundant number, since it is smaller than the sum of its proper divisors (130868724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74076828 is a wasteful number, since it uses less digits than its factorization.
74076828 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2451 (or 2442 counting only the distinct ones).
The product of its (nonzero) digits is 150528, while the sum is 42.
The square root of 74076828 is about 8606.7896453904. The cubic root of 74076828 is about 419.9788878277.
The spelling of 74076828 in words is "seventy-four million, seventy-six thousand, eight hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •