Base | Representation |
---|---|
bin | 1000110101000… |
… | …10101110010000 |
3 | 12011100222121000 |
4 | 10122202232100 |
5 | 122430114312 |
6 | 11203302000 |
7 | 1556362200 |
oct | 432425620 |
9 | 164328530 |
10 | 74066832 |
11 | 38899564 |
12 | 2097a900 |
13 | 12463938 |
14 | 9ba0400 |
15 | 6780adc |
hex | 46a2b90 |
74066832 has 120 divisors (see below), whose sum is σ = 247380000. Its totient is φ = 21155904.
The previous prime is 74066819. The next prime is 74066851. The reversal of 74066832 is 23866047.
It is a Harshad number since it is a multiple of its sum of digits (36).
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 23 ways as a sum of consecutive naturals, for example, 19419 + ... + 22917.
It is an arithmetic number, because the mean of its divisors is an integer number (2061500).
Almost surely, 274066832 is an apocalyptic number.
74066832 is a gapful number since it is divisible by the number (72) 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 74066832, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123690000).
74066832 is an abundant number, since it is smaller than the sum of its proper divisors (173313168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74066832 is a wasteful number, since it uses less digits than its factorization.
74066832 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3530 (or 3511 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 36.
The square root of 74066832 is about 8606.2089214706. The cubic root of 74066832 is about 419.9599961899.
The spelling of 74066832 in words is "seventy-four million, sixty-six thousand, eight hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •