Base | Representation |
---|---|
bin | 101001100110101111… |
… | …0100001110000001100 |
3 | 22112121201112111111210 |
4 | 1103031132201300030 |
5 | 2430440222142042 |
6 | 105013441214420 |
7 | 6312044142012 |
oct | 1231536416014 |
9 | 275551474453 |
10 | 89346677772 |
11 | 34989963470 |
12 | 15396031410 |
13 | 856b677091 |
14 | 44782348b2 |
15 | 24cdd29a9c |
hex | 14cd7a1c0c |
89346677772 has 96 divisors (see below), whose sum is σ = 239666563584. Its totient is φ = 25641088000.
The previous prime is 89346677743. The next prime is 89346677773. The reversal of 89346677772 is 27777664398.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is not an unprimeable number, because it can be changed into a prime (89346677773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 160948 + ... + 452324.
It is an arithmetic number, because the mean of its divisors is an integer number (2496526704).
Almost surely, 289346677772 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 89346677772, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (119833281792).
89346677772 is an abundant number, since it is smaller than the sum of its proper divisors (150319885812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89346677772 is a wasteful number, since it uses less digits than its factorization.
89346677772 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291519 (or 291517 counting only the distinct ones).
The product of its digits is 149361408, while the sum is 66.
The spelling of 89346677772 in words is "eighty-nine billion, three hundred forty-six million, six hundred seventy-seven thousand, seven hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •