Base | Representation |
---|---|
bin | 1100100110111… |
… | …1111110001000 |
3 | 10200111221220210 |
4 | 3021233332020 |
5 | 102014344212 |
6 | 5125321120 |
7 | 1211351523 |
oct | 311577610 |
9 | 120457823 |
10 | 52887432 |
11 | 27943124 |
12 | 158661a0 |
13 | ac59750 |
14 | 7049bba |
15 | 499a53c |
hex | 326ff88 |
52887432 has 64 divisors (see below), whose sum is σ = 143095680. Its totient is φ = 16192512.
The previous prime is 52887413. The next prime is 52887473. The reversal of 52887432 is 23478825.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 104893 + ... + 105395.
It is an arithmetic number, because the mean of its divisors is an integer number (2235870).
Almost surely, 252887432 is an apocalyptic number.
52887432 is a gapful number since it is divisible by the number (52) 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 52887432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71547840).
52887432 is an abundant number, since it is smaller than the sum of its proper divisors (90208248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52887432 is a wasteful number, since it uses less digits than its factorization.
52887432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 862 (or 858 counting only the distinct ones).
The product of its digits is 107520, while the sum is 39.
The square root of 52887432 is about 7272.3745778116. The cubic root of 52887432 is about 375.3624513423.
It can be divided in two parts, 528874 and 32, that added together give a triangular number (528906 = T1028).
The spelling of 52887432 in words is "fifty-two million, eight hundred eighty-seven thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •