Base | Representation |
---|---|
bin | 1011110000111… |
… | …00101100000000 |
3 | 20212200122111221 |
4 | 11320130230000 |
5 | 200230334043 |
6 | 13443044424 |
7 | 2305540300 |
oct | 570345400 |
9 | 225618457 |
10 | 98683648 |
11 | 50782538 |
12 | 29070714 |
13 | 175a25bb |
14 | d16b600 |
15 | 89e48ed |
hex | 5e1cb00 |
98683648 has 54 divisors (see below), whose sum is σ = 229171236. Its totient is φ = 42287616.
The previous prime is 98683643. The next prime is 98683661. The reversal of 98683648 is 84638689.
It is a junction number, because it is equal to n+sod(n) for n = 98683595 and 98683604.
It is not an unprimeable number, because it can be changed into a prime (98683643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8611 + ... + 16477.
Almost surely, 298683648 is an apocalyptic number.
98683648 is a gapful number since it is divisible by the number (98) 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 98683648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (114585618).
98683648 is an abundant number, since it is smaller than the sum of its proper divisors (130487588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
98683648 is an equidigital number, since it uses as much as digits as its factorization.
98683648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7897 (or 7876 counting only the distinct ones).
The product of its digits is 1990656, while the sum is 52.
The square root of 98683648 is about 9933.9643647438. The cubic root of 98683648 is about 462.1132259982.
The spelling of 98683648 in words is "ninety-eight million, six hundred eighty-three thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •