Base | Representation |
---|---|
bin | 1000011110000… |
… | …10001110101110 |
3 | 11221200201111100 |
4 | 10033002032232 |
5 | 121142101113 |
6 | 11014503530 |
7 | 1521626214 |
oct | 417021656 |
9 | 157621440 |
10 | 71050158 |
11 | 37119043 |
12 | 1b964ba6 |
13 | 1194881a |
14 | 9616cb4 |
15 | 6386d73 |
hex | 43c23ae |
71050158 has 48 divisors (see below), whose sum is σ = 164062080. Its totient is φ = 22157712.
The previous prime is 71050153. The next prime is 71050169. The reversal of 71050158 is 85105017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71050153) 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 23 ways as a sum of consecutive naturals, for example, 27135 + ... + 29637.
It is an arithmetic number, because the mean of its divisors is an integer number (3417960).
Almost surely, 271050158 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 71050158, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82031040).
71050158 is an abundant number, since it is smaller than the sum of its proper divisors (93011922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71050158 is a wasteful number, since it uses less digits than its factorization.
71050158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2613 (or 2610 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 27.
The square root of 71050158 is about 8429.1255774250. The cubic root of 71050158 is about 414.1792614433.
The spelling of 71050158 in words is "seventy-one million, fifty thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •