Base | Representation |
---|---|
bin | 1000011110111… |
… | …00110001011000 |
3 | 11221220020121210 |
4 | 10033130301120 |
5 | 121204040442 |
6 | 11021103120 |
7 | 1522561161 |
oct | 417346130 |
9 | 157806553 |
10 | 71158872 |
11 | 37192794 |
12 | 1b9b7aa0 |
13 | 11986155 |
14 | 9644768 |
15 | 63a919c |
hex | 43dcc58 |
71158872 has 64 divisors (see below), whose sum is σ = 196577280. Its totient is φ = 21350912.
The previous prime is 71158861. The next prime is 71158877. The reversal of 71158872 is 27885117.
It is a self number, because there is not a number n which added to its sum of digits gives 71158872.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71158877) 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 15 ways as a sum of consecutive naturals, for example, 5593 + ... + 13175.
It is an arithmetic number, because the mean of its divisors is an integer number (3071520).
Almost surely, 271158872 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 71158872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98288640).
71158872 is an abundant number, since it is smaller than the sum of its proper divisors (125418408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71158872 is a wasteful number, since it uses less digits than its factorization.
71158872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7632 (or 7628 counting only the distinct ones).
The product of its digits is 31360, while the sum is 39.
The square root of 71158872 is about 8435.5718241267. The cubic root of 71158872 is about 414.3903993194.
The spelling of 71158872 in words is "seventy-one million, one hundred fifty-eight thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •