Base | Representation |
---|---|
bin | 1010101100000… |
… | …11111111011000 |
3 | 20020201200120000 |
4 | 11112003333120 |
5 | 140423411332 |
6 | 12521533000 |
7 | 2136115245 |
oct | 526037730 |
9 | 206650500 |
10 | 89669592 |
11 | 46686101 |
12 | 26044160 |
13 | 1576773c |
14 | bca25cc |
15 | 7d13b7c |
hex | 5583fd8 |
89669592 has 80 divisors (see below), whose sum is σ = 254826000. Its totient is φ = 29453760.
The previous prime is 89669581. The next prime is 89669621. The reversal of 89669592 is 29596698.
Added to its reverse (29596698) it gives a triangular number (119266290 = T15444).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 45034 + ... + 46982.
It is an arithmetic number, because the mean of its divisors is an integer number (3185325).
Almost surely, 289669592 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 89669592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127413000).
89669592 is an abundant number, since it is smaller than the sum of its proper divisors (165156408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89669592 is a wasteful number, since it uses less digits than its factorization.
89669592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2038 (or 2025 counting only the distinct ones).
The product of its digits is 2099520, while the sum is 54.
The square root of 89669592 is about 9469.4029378837. The cubic root of 89669592 is about 447.5913977460.
Adding to 89669592 its reverse (29596698), we get a triangular number (119266290 = T15444).
The spelling of 89669592 in words is "eighty-nine million, six hundred sixty-nine thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •