Base | Representation |
---|---|
bin | 1010101010111… |
… | …00111010100000 |
3 | 20020102120000000 |
4 | 11111130322200 |
5 | 140403301121 |
6 | 12514300000 |
7 | 2134550514 |
oct | 525347240 |
9 | 206376000 |
10 | 89509536 |
11 | 46586926 |
12 | 25b87600 |
13 | 1570c92c |
14 | bc60144 |
15 | 7cd1526 |
hex | 555cea0 |
89509536 has 96 divisors (see below), whose sum is σ = 264499200. Its totient is φ = 29813184.
The previous prime is 89509529. The next prime is 89509561. The reversal of 89509536 is 63590598.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 89509491 and 89509500.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69345 + ... + 70623.
It is an arithmetic number, because the mean of its divisors is an integer number (2755200).
Almost surely, 289509536 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 89509536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (132249600).
89509536 is an abundant number, since it is smaller than the sum of its proper divisors (174989664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89509536 is an equidigital number, since it uses as much as digits as its factorization.
89509536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1310 (or 1284 counting only the distinct ones).
The product of its (nonzero) digits is 291600, while the sum is 45.
The square root of 89509536 is about 9460.9479440487. The cubic root of 89509536 is about 447.3249292811.
The spelling of 89509536 in words is "eighty-nine million, five hundred nine thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •