Base | Representation |
---|---|
bin | 1000100011010… |
… | …10101011100000 |
3 | 11222222202221210 |
4 | 10101222223200 |
5 | 121331141003 |
6 | 11041350120 |
7 | 1530531615 |
oct | 421525340 |
9 | 158882853 |
10 | 71740128 |
11 | 3754a469 |
12 | 20038340 |
13 | 11b2a8a5 |
14 | 975650c |
15 | 6471503 |
hex | 446aae0 |
71740128 has 48 divisors (see below), whose sum is σ = 196511616. Its totient is φ = 22872960.
The previous prime is 71740127. The next prime is 71740129. The reversal of 71740128 is 82104717.
It is an interprime number because it is at equal distance from previous prime (71740127) and next prime (71740129).
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 71740095 and 71740104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71740121) 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 7 ways as a sum of consecutive naturals, for example, 14038 + ... + 18453.
It is an arithmetic number, because the mean of its divisors is an integer number (4093992).
Almost surely, 271740128 is an apocalyptic number.
It is an amenable number.
71740128 is an abundant number, since it is smaller than the sum of its proper divisors (124771488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71740128 is a wasteful number, since it uses less digits than its factorization.
71740128 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32527 (or 32519 counting only the distinct ones).
The product of its (nonzero) digits is 3136, while the sum is 30.
The square root of 71740128 is about 8469.9544272682. The cubic root of 71740128 is about 415.5156468337.
The spelling of 71740128 in words is "seventy-one million, seven hundred forty thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •