Base | Representation |
---|---|
bin | 1000111001001… |
… | …01010011100000 |
3 | 12012101011021210 |
4 | 10130211103200 |
5 | 123044223241 |
6 | 11222550120 |
7 | 1564050441 |
oct | 434452340 |
9 | 165334253 |
10 | 74601696 |
11 | 391243a4 |
12 | 20b98340 |
13 | 125c0220 |
14 | 9c9d2c8 |
15 | 6839316 |
hex | 47254e0 |
74601696 has 144 divisors (see below), whose sum is σ = 222412176. Its totient is φ = 21762048.
The previous prime is 74601691. The next prime is 74601727. The reversal of 74601696 is 69610647.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (74601691) by changing a digit.
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, 660136 + ... + 660248.
It is an arithmetic number, because the mean of its divisors is an integer number (1544529).
Almost surely, 274601696 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 74601696, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111206088).
74601696 is an abundant number, since it is smaller than the sum of its proper divisors (147810480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
74601696 is a wasteful number, since it uses less digits than its factorization.
74601696 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185 (or 154 counting only the distinct ones).
The product of its (nonzero) digits is 54432, while the sum is 39.
The square root of 74601696 is about 8637.2273328887. The cubic root of 74601696 is about 420.9684680638.
The spelling of 74601696 in words is "seventy-four million, six hundred one thousand, six hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •