Base | Representation |
---|---|
bin | 1000100001010… |
… | …10101101110100 |
3 | 11222111110120020 |
4 | 10100222231310 |
5 | 121244300012 |
6 | 11032005140 |
7 | 1525361025 |
oct | 420525564 |
9 | 158443506 |
10 | 71478132 |
11 | 37390640 |
12 | 1bb307b0 |
13 | 11a6856b |
14 | 96c8c4c |
15 | 641da8c |
hex | 442ab74 |
71478132 has 96 divisors (see below), whose sum is σ = 196608384. Its totient is φ = 19968000.
The previous prime is 71478107. The next prime is 71478137. The reversal of 71478132 is 23187417.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 71478093 and 71478102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (71478137) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 118632 + ... + 119232.
It is an arithmetic number, because the mean of its divisors is an integer number (2048004).
Almost surely, 271478132 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 71478132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (98304192).
71478132 is an abundant number, since it is smaller than the sum of its proper divisors (125130252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
71478132 is a wasteful number, since it uses less digits than its factorization.
71478132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 689 (or 687 counting only the distinct ones).
The product of its digits is 9408, while the sum is 33.
The square root of 71478132 is about 8454.4740818102. The cubic root of 71478132 is about 415.0092067440.
The spelling of 71478132 in words is "seventy-one million, four hundred seventy-eight thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •