Base | Representation |
---|---|
bin | 1000011110000… |
… | …11111010101110 |
3 | 11221201001222100 |
4 | 10033003322232 |
5 | 121142311240 |
6 | 11014555530 |
7 | 1521655320 |
oct | 417037256 |
9 | 157631870 |
10 | 71057070 |
11 | 37123257 |
12 | 1b968ba6 |
13 | 1194ba06 |
14 | 9619610 |
15 | 6388e30 |
hex | 43c3eae |
71057070 has 144 divisors (see below), whose sum is σ = 219709152. Its totient is φ = 15603840.
The previous prime is 71057069. The next prime is 71057071. The reversal of 71057070 is 7075017.
It is an interprime number because it is at equal distance from previous prime (71057069) and next prime (71057071).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71057071) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1164840 + ... + 1164900.
It is an arithmetic number, because the mean of its divisors is an integer number (1525758).
Almost surely, 271057070 is an apocalyptic number.
71057070 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 71057070, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (109854576).
71057070 is an abundant number, since it is smaller than the sum of its proper divisors (148652082).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71057070 is a wasteful number, since it uses less digits than its factorization.
71057070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167 (or 121 counting only the distinct ones).
The product of its (nonzero) digits is 1715, while the sum is 27.
The square root of 71057070 is about 8429.5355743955. The cubic root of 71057070 is about 414.1926919282.
The spelling of 71057070 in words is "seventy-one million, fifty-seven thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •