Base | Representation |
---|---|
bin | 10111011100100… |
… | …10100110101000 |
3 | 111201002121000000 |
4 | 23232102212220 |
5 | 400322343300 |
6 | 31303343000 |
7 | 4605534216 |
oct | 1356224650 |
9 | 451077000 |
10 | 196684200 |
11 | a1028829 |
12 | 55a51a60 |
13 | 31995cab |
14 | 1c19bcb6 |
15 | 12401c00 |
hex | bb929a8 |
196684200 has 336 divisors, whose sum is σ = 731872800. Its totient is φ = 48988800.
The previous prime is 196684199. The next prime is 196684211. The reversal of 196684200 is 2486691.
196684200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 2770165 + ... + 2770235.
Almost surely, 2196684200 is an apocalyptic number.
196684200 is a gapful number since it is divisible by the number (10) 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 196684200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (365936400).
196684200 is an abundant number, since it is smaller than the sum of its proper divisors (535188600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196684200 is a wasteful number, since it uses less digits than its factorization.
196684200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124 (or 100 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 36.
The square root of 196684200 is about 14024.4144262782. The cubic root of 196684200 is about 581.5537018507.
The spelling of 196684200 in words is "one hundred ninety-six million, six hundred eighty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •