Base | Representation |
---|---|
bin | 101001110101111010… |
… | …1011100000000000000 |
3 | 22120221012220202021000 |
4 | 1103223311130000000 |
5 | 2433011114000000 |
6 | 105140153532000 |
7 | 6330500253324 |
oct | 1235365340000 |
9 | 276835822230 |
10 | 89856000000 |
11 | 35120407828 |
12 | 154b8714000 |
13 | 8620044390 |
14 | 44c5b35984 |
15 | 250d8d5000 |
hex | 14ebd5c000 |
89856000000 has 840 divisors, whose sum is σ = 358384475120. Its totient is φ = 22118400000.
The previous prime is 89855999999. The next prime is 89856000079. The reversal of 89856000000 is 65898.
89856000000 is a `hidden beast` number, since 8 + 98 + 560 + 0 + 0 + 0 + 0 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 6911999994 + ... + 6912000006.
Almost surely, 289856000000 is an apocalyptic number.
89856000000 is a gapful number since it is divisible by the number (80) 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 89856000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179192237560).
89856000000 is an abundant number, since it is smaller than the sum of its proper divisors (268528475120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
89856000000 is an frugal number, since it uses more digits than its factorization.
89856000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80 (or 23 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
Adding to 89856000000 its reverse (65898), we get a palindrome (89856065898).
The spelling of 89856000000 in words is "eighty-nine billion, eight hundred fifty-six million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •