Base | Representation |
---|---|
bin | 10111011000011… |
… | …11101001110110 |
3 | 111200002100020110 |
4 | 23230033221312 |
5 | 400203212310 |
6 | 31244043450 |
7 | 4601141364 |
oct | 1354175166 |
9 | 450070213 |
10 | 196147830 |
11 | a07a184a |
12 | 55833586 |
13 | 31838b08 |
14 | 1c09c634 |
15 | 12347d20 |
hex | bb0fa76 |
196147830 has 64 divisors (see below), whose sum is σ = 498378240. Its totient is φ = 49268736.
The previous prime is 196147829. The next prime is 196147837. The reversal of 196147830 is 38741691.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (196147837) 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 31 ways as a sum of consecutive naturals, for example, 109119 + ... + 110901.
It is an arithmetic number, because the mean of its divisors is an integer number (7787160).
Almost surely, 2196147830 is an apocalyptic number.
196147830 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 196147830, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (249189120).
196147830 is an abundant number, since it is smaller than the sum of its proper divisors (302230410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196147830 is a wasteful number, since it uses less digits than its factorization.
196147830 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2005.
The product of its (nonzero) digits is 36288, while the sum is 39.
The square root of 196147830 is about 14005.2786477099. The cubic root of 196147830 is about 581.0245762467.
The spelling of 196147830 in words is "one hundred ninety-six million, one hundred forty-seven thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •