Base | Representation |
---|---|
bin | 1000111110101… |
… | …10111000000100 |
3 | 12020202010000000 |
4 | 10133112320010 |
5 | 123241012103 |
6 | 11250321300 |
7 | 1603200105 |
oct | 437267004 |
9 | 166663000 |
10 | 75329028 |
11 | 395808a5 |
12 | 21289230 |
13 | 127b62b8 |
14 | a00c3ac |
15 | 692eaa3 |
hex | 47d6e04 |
75329028 has 96 divisors (see below), whose sum is σ = 202048000. Its totient is φ = 24564384.
The previous prime is 75329021. The next prime is 75329099. The reversal of 75329028 is 82092357.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 75328983 and 75329001.
It is not an unprimeable number, because it can be changed into a prime (75329021) 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 31 ways as a sum of consecutive naturals, for example, 691038 + ... + 691146.
Almost surely, 275329028 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 75329028, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101024000).
75329028 is an abundant number, since it is smaller than the sum of its proper divisors (126718972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75329028 is a wasteful number, since it uses less digits than its factorization.
75329028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213 (or 193 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
The square root of 75329028 is about 8679.2296893215. The cubic root of 75329028 is about 422.3321284932.
The spelling of 75329028 in words is "seventy-five million, three hundred twenty-nine thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •