Base | Representation |
---|---|
bin | 101110000011011000… |
… | …0101110111100000000 |
3 | 100110021100110000002100 |
4 | 1130012300232330000 |
5 | 3110020301430042 |
6 | 113233304350400 |
7 | 10100530314600 |
oct | 1340660567400 |
9 | 313240400070 |
10 | 98897686272 |
11 | 38a40190520 |
12 | 17200775400 |
13 | 943132b8b8 |
14 | 4b028bcc00 |
15 | 288c59824c |
hex | 1706c2ef00 |
98897686272 has 648 divisors, whose sum is σ = 366031319472. Its totient is φ = 25391923200.
The previous prime is 98897686211. The next prime is 98897686273. The reversal of 98897686272 is 27268679889.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 98897686272.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (98897686273) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 120459622 + ... + 120460442.
Almost surely, 298897686272 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 98897686272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (183015659736).
98897686272 is an abundant number, since it is smaller than the sum of its proper divisors (267133633200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
98897686272 is a wasteful number, since it uses less digits than its factorization.
98897686272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 965 (or 941 counting only the distinct ones).
The product of its digits is 292626432, while the sum is 72.
The spelling of 98897686272 in words is "ninety-eight billion, eight hundred ninety-seven million, six hundred eighty-six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •