Base | Representation |
---|---|
bin | 1010100101111… |
… | …10010111100100 |
3 | 20012012120012000 |
4 | 11102332113210 |
5 | 140222011012 |
6 | 12452325300 |
7 | 2126204304 |
oct | 522762744 |
9 | 205176160 |
10 | 88860132 |
11 | 46182a29 |
12 | 25913830 |
13 | 1554317a |
14 | bb31604 |
15 | 7c03ddc |
hex | 54be5e4 |
88860132 has 96 divisors (see below), whose sum is σ = 243855360. Its totient is φ = 27925920.
The previous prime is 88860097. The next prime is 88860137. The reversal of 88860132 is 23106888.
It is a super-2 number, since 2×888601322 = 15792246118114848, which contains 22 as substring.
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 (88860137) 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, 205957 + ... + 206387.
It is an arithmetic number, because the mean of its divisors is an integer number (2540160).
Almost surely, 288860132 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 88860132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (121927680).
88860132 is an abundant number, since it is smaller than the sum of its proper divisors (154995228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
88860132 is a wasteful number, since it uses less digits than its factorization.
88860132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550 (or 542 counting only the distinct ones).
The product of its (nonzero) digits is 18432, while the sum is 36.
The square root of 88860132 is about 9426.5652281199. The cubic root of 88860132 is about 446.2405011748.
The spelling of 88860132 in words is "eighty-eight million, eight hundred sixty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •