Base | Representation |
---|---|
bin | 1000110100110… |
… | …00100000101000 |
3 | 12011021212012200 |
4 | 10122120200220 |
5 | 122422300000 |
6 | 11202340200 |
7 | 1556126220 |
oct | 432304050 |
9 | 164255180 |
10 | 74025000 |
11 | 38870095 |
12 | 2095a660 |
13 | 1244a89a |
14 | 9b8d080 |
15 | 6773500 |
hex | 4698828 |
74025000 has 288 divisors, whose sum is σ = 292481280. Its totient is φ = 16560000.
The previous prime is 74024989. The next prime is 74025013. The reversal of 74025000 is 52047.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1574977 + ... + 1575023.
It is an arithmetic number, because the mean of its divisors is an integer number (1015560).
Almost surely, 274025000 is an apocalyptic number.
74025000 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 74025000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146240640).
74025000 is an abundant number, since it is smaller than the sum of its proper divisors (218456280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74025000 is a wasteful number, since it uses less digits than its factorization.
74025000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91 (or 64 counting only the distinct ones).
The product of its (nonzero) digits is 280, while the sum is 18.
The square root of 74025000 is about 8603.7782398200. The cubic root of 74025000 is about 419.8809186213.
Adding to 74025000 its reverse (52047), we get a palindrome (74077047).
The spelling of 74025000 in words is "seventy-four million, twenty-five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.158 sec. • engine limits •