Base | Representation |
---|---|
bin | 1011100100110100010… |
… | …0110110000000000000 |
3 | 201000022000012112101011 |
4 | 2321031010312000000 |
5 | 11224232033023013 |
6 | 231204502250304 |
7 | 20236655542444 |
oct | 2711504660000 |
9 | 630260175334 |
10 | 198861611008 |
11 | 77378216755 |
12 | 3265a426994 |
13 | 159a251a018 |
14 | 98a6c2c824 |
15 | 528d558c3d |
hex | 2e4d136000 |
198861611008 has 112 divisors (see below), whose sum is σ = 424163733840. Its totient is φ = 92899639296.
The previous prime is 198861610979. The next prime is 198861611041. The reversal of 198861611008 is 800116168891.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 19352560 + ... + 19362832.
It is an arithmetic number, because the mean of its divisors is an integer number (3787176195).
Almost surely, 2198861611008 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 198861611008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (212081866920).
198861611008 is an abundant number, since it is smaller than the sum of its proper divisors (225302122832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
198861611008 is a wasteful number, since it uses less digits than its factorization.
198861611008 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10455 (or 10431 counting only the distinct ones).
The product of its (nonzero) digits is 165888, while the sum is 49.
Adding to 198861611008 its reverse (800116168891), we get a palindrome (998977779899).
The spelling of 198861611008 in words is "one hundred ninety-eight billion, eight hundred sixty-one million, six hundred eleven thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •