Base | Representation |
---|---|
bin | 1000011110100… |
… | …10001011100000 |
3 | 11221211001002222 |
4 | 10033102023200 |
5 | 121201143423 |
6 | 11020130212 |
7 | 1522320533 |
oct | 417221340 |
9 | 157731088 |
10 | 71115488 |
11 | 37163134 |
12 | 1b996968 |
13 | 1196c492 |
14 | 9632a1a |
15 | 639b3c8 |
hex | 43d22e0 |
71115488 has 48 divisors (see below), whose sum is σ = 153062784. Its totient is φ = 32378880.
The previous prime is 71115481. The next prime is 71115493. The reversal of 71115488 is 88451117.
It is a Cunningham number, because it is equal to 84332-1.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71115481) 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, 14756 + ... + 18972.
It is an arithmetic number, because the mean of its divisors is an integer number (3188808).
Almost surely, 271115488 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 71115488, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (76531392).
71115488 is an abundant number, since it is smaller than the sum of its proper divisors (81947296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71115488 is a wasteful number, since it uses less digits than its factorization.
71115488 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4275 (or 4267 counting only the distinct ones).
The product of its digits is 8960, while the sum is 35.
The square root of 71115488 is about 8432.9999407091. Note that the first 4 decimals coincide. The cubic root of 71115488 is about 414.3061672933.
The spelling of 71115488 in words is "seventy-one million, one hundred fifteen thousand, four hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •