Base | Representation |
---|---|
bin | 10111011101001… |
… | …00111100000000 |
3 | 111201020102000100 |
4 | 23232210330000 |
5 | 400332244141 |
6 | 31305122400 |
7 | 4606266156 |
oct | 1356447400 |
9 | 451212010 |
10 | 196759296 |
11 | a107a198 |
12 | 55a89400 |
13 | 319c1226 |
14 | 1c1bb3d6 |
15 | 124190b6 |
hex | bba4f00 |
196759296 has 216 divisors, whose sum is σ = 612218880. Its totient is φ = 60622848.
The previous prime is 196759289. The next prime is 196759313. The reversal of 196759296 is 692957691.
It is a Smith number, since the sum of its digits (54) coincides with the sum of the digits of its prime factors.
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 23 ways as a sum of consecutive naturals, for example, 2490585 + ... + 2490663.
Almost surely, 2196759296 is an apocalyptic number.
196759296 is a gapful number since it is divisible by the number (16) 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 196759296, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (306109440).
196759296 is an abundant number, since it is smaller than the sum of its proper divisors (415459584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
196759296 is a wasteful number, since it uses less digits than its factorization.
196759296 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171 (or 154 counting only the distinct ones).
The product of its digits is 1837080, while the sum is 54.
The square root of 196759296 is about 14027.0915018046. The cubic root of 196759296 is about 581.6277067781.
The spelling of 196759296 in words is "one hundred ninety-six million, seven hundred fifty-nine thousand, two hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •