Base | Representation |
---|---|
bin | 1000100000101… |
… | …00001100111000 |
3 | 11222022210001200 |
4 | 10100110030320 |
5 | 121233322122 |
6 | 11030014200 |
7 | 1524525123 |
oct | 420241470 |
9 | 158283050 |
10 | 71385912 |
11 | 37328324 |
12 | 1baa7360 |
13 | 11a355b0 |
14 | 96a33ba |
15 | 64015ac |
hex | 4414338 |
71385912 has 96 divisors (see below), whose sum is σ = 212284800. Its totient is φ = 21535488.
The previous prime is 71385911. The next prime is 71385931. The reversal of 71385912 is 21958317.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71385911) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 48889 + ... + 50327.
It is an arithmetic number, because the mean of its divisors is an integer number (2211300).
Almost surely, 271385912 is an apocalyptic number.
71385912 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 71385912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (106142400).
71385912 is an abundant number, since it is smaller than the sum of its proper divisors (140898888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71385912 is a wasteful number, since it uses less digits than its factorization.
71385912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1517 (or 1510 counting only the distinct ones).
The product of its digits is 15120, while the sum is 36.
The square root of 71385912 is about 8449.0184045249. The cubic root of 71385912 is about 414.8306504072.
The spelling of 71385912 in words is "seventy-one million, three hundred eighty-five thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •