Base | Representation |
---|---|
bin | 1000011110000… |
… | …11101000110000 |
3 | 11221201000101202 |
4 | 10033003220300 |
5 | 121142242140 |
6 | 11014550332 |
7 | 1521652055 |
oct | 417035060 |
9 | 157630352 |
10 | 71055920 |
11 | 37122401 |
12 | 1b9683a8 |
13 | 1194b330 |
14 | 961902c |
15 | 6388915 |
hex | 43c3a30 |
71055920 has 80 divisors (see below), whose sum is σ = 188425440. Its totient is φ = 24686592.
The previous prime is 71055917. The next prime is 71055949. The reversal of 71055920 is 2955017.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 15671 + ... + 19689.
It is an arithmetic number, because the mean of its divisors is an integer number (2355318).
Almost surely, 271055920 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 71055920, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94212720).
71055920 is an abundant number, since it is smaller than the sum of its proper divisors (117369520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71055920 is a wasteful number, since it uses less digits than its factorization.
With its predecessor (71055919) it forms a Ruth-Aaron pair, since the sum of their prime factors is the same (4062).
71055920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4062 (or 4056 counting only the distinct ones).
The product of its (nonzero) digits is 3150, while the sum is 29.
The square root of 71055920 is about 8429.4673615834. The cubic root of 71055920 is about 414.1904574606.
The spelling of 71055920 in words is "seventy-one million, fifty-five thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •