Base | Representation |
---|---|
bin | 101101110110011101… |
… | …0001000000000000000 |
3 | 100102011010021102220010 |
4 | 1123230322020000000 |
5 | 3103123232044413 |
6 | 113122251544520 |
7 | 10054012454145 |
oct | 1335472100000 |
9 | 312133242803 |
10 | 98463940608 |
11 | 38838366a30 |
12 | 170bb45b140 |
13 | 9392503467 |
14 | 4aa10523cc |
15 | 286446adc3 |
hex | 16ece88000 |
98463940608 has 512 divisors, whose sum is σ = 309836897280. Its totient is φ = 27509391360.
The previous prime is 98463940543. The next prime is 98463940609. The reversal of 98463940608 is 80604936489.
It is a tau number, because it is divible by the number of its divisors (512).
It is not an unprimeable number, because it can be changed into a prime (98463940609) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 920223691 + ... + 920223797.
It is an arithmetic number, because the mean of its divisors is an integer number (605150190).
Almost surely, 298463940608 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 98463940608, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (154918448640).
98463940608 is an abundant number, since it is smaller than the sum of its proper divisors (211372956672).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
98463940608 is a wasteful number, since it uses less digits than its factorization.
98463940608 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211 (or 183 counting only the distinct ones).
The product of its (nonzero) digits is 8957952, while the sum is 57.
The spelling of 98463940608 in words is "ninety-eight billion, four hundred sixty-three million, nine hundred forty thousand, six hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •