Base | Representation |
---|---|
bin | 1011100101000110001… |
… | …0010110110000011100 |
3 | 201000111020001001201001 |
4 | 2321101202112300130 |
5 | 11224410213044340 |
6 | 231220134400044 |
7 | 20241554656165 |
oct | 2712142266034 |
9 | 630436031631 |
10 | 198936456220 |
11 | 77406496aa7 |
12 | 3267b500024 |
13 | 159b4b94028 |
14 | 98b2b5276c |
15 | 5294de029a |
hex | 2e51896c1c |
198936456220 has 24 divisors (see below), whose sum is σ = 435930322464. Its totient is φ = 76114817856.
The previous prime is 198936456193. The next prime is 198936456221. The reversal of 198936456220 is 22654639891.
It is a super-2 number, since 2×1989364562202 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (198936456221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 216234819 + ... + 216235738.
It is an arithmetic number, because the mean of its divisors is an integer number (18163763436).
Almost surely, 2198936456220 is an apocalyptic number.
198936456220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
198936456220 is an abundant number, since it is smaller than the sum of its proper divisors (236993866244).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
198936456220 is a wasteful number, since it uses less digits than its factorization.
198936456220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432470589 (or 432470587 counting only the distinct ones).
The product of its (nonzero) digits is 5598720, while the sum is 55.
The spelling of 198936456220 in words is "one hundred ninety-eight billion, nine hundred thirty-six million, four hundred fifty-six thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •