Base | Representation |
---|---|
bin | 1000011110111… |
… | …01010110111000 |
3 | 11221220100220200 |
4 | 10033131112320 |
5 | 121204130042 |
6 | 11021122200 |
7 | 1522601160 |
oct | 417352670 |
9 | 157810820 |
10 | 71161272 |
11 | 37194576 |
12 | 1b9b9360 |
13 | 11987280 |
14 | 96455a0 |
15 | 63a9c4c |
hex | 43dd5b8 |
71161272 has 96 divisors (see below), whose sum is σ = 237226080. Its totient is φ = 18766080.
The previous prime is 71161247. The next prime is 71161291. The reversal of 71161272 is 27216117.
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1122 + ... + 11982.
It is an arithmetic number, because the mean of its divisors is an integer number (2471105).
Almost surely, 271161272 is an apocalyptic number.
71161272 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 71161272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (118613040).
71161272 is an abundant number, since it is smaller than the sum of its proper divisors (166064808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71161272 is a wasteful number, since it uses less digits than its factorization.
71161272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10893 (or 10886 counting only the distinct ones).
The product of its digits is 1176, while the sum is 27.
The square root of 71161272 is about 8435.7140776582. The cubic root of 71161272 is about 414.3950580300.
Adding to 71161272 its reverse (27216117), we get a palindrome (98377389).
The spelling of 71161272 in words is "seventy-one million, one hundred sixty-one thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •