Search a number
-
+
196911000 = 233453111317
BaseRepresentation
bin10111011110010…
…01111110011000
3111201112010010000
423233021332120
5400402123000
631312253000
74610500356
oct1357117630
9451463100
10196911000
11a1173170
1255b41160
1331a452b0
141c21a7d6
1512449000
hexbbc9f98

196911000 has 640 divisors, whose sum is σ = 856215360. Its totient is φ = 41472000.

The previous prime is 196910999. The next prime is 196911023. The reversal of 196911000 is 119691.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a congruent number.

It is an unprimeable number.

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 159 ways as a sum of consecutive naturals, for example, 11582992 + ... + 11583008.

Almost surely, 2196911000 is an apocalyptic number.

196911000 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 196911000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (428107680).

196911000 is an abundant number, since it is smaller than the sum of its proper divisors (659304360).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

196911000 is a wasteful number, since it uses less digits than its factorization.

196911000 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 74 (or 51 counting only the distinct ones).

The product of its (nonzero) digits is 486, while the sum is 27.

The square root of 196911000 is about 14032.4979957241. The cubic root of 196911000 is about 581.7771492429. Note that the first 3 decimals are identical.

The spelling of 196911000 in words is "one hundred ninety-six million, nine hundred eleven thousand".