Base | Representation |
---|---|
bin | 1011100110011100100… |
… | …1111110101010111100 |
3 | 201001102111112120102101 |
4 | 2321213021332222330 |
5 | 11231131041233420 |
6 | 231320132434444 |
7 | 20253550643605 |
oct | 2714711765274 |
9 | 631374476371 |
10 | 199299164860 |
11 | 77582201404 |
12 | 32760a78a24 |
13 | 15a42079923 |
14 | 9908daadac |
15 | 52b6b8960a |
hex | 2e6727eabc |
199299164860 has 24 divisors (see below), whose sum is σ = 418541641056. Its totient is φ = 79717114560.
The previous prime is 199299164809. The next prime is 199299164893. The reversal of 199299164860 is 68461992991.
It is a super-2 number, since 2×1992991648602 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 199299164792 and 199299164801.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 560314 + ... + 844126.
It is an arithmetic number, because the mean of its divisors is an integer number (17439235044).
Almost surely, 2199299164860 is an apocalyptic number.
199299164860 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
199299164860 is an abundant number, since it is smaller than the sum of its proper divisors (219242476196).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
199299164860 is a wasteful number, since it uses less digits than its factorization.
199299164860 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318933 (or 318931 counting only the distinct ones).
The product of its (nonzero) digits is 15116544, while the sum is 64.
The spelling of 199299164860 in words is "one hundred ninety-nine billion, two hundred ninety-nine million, one hundred sixty-four thousand, eight hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •