Search a number
-
+
196919691960 = 233543476712119
BaseRepresentation
bin1011011101100101010…
…1000000101010111000
3200211021200010211020110
42313121111000222320
511211242420120320
6230244052224320
720140565523045
oct2673125005270
9624250124213
10196919691960
117657103a182
12321b800b0a0
13157530ca2b4
149760d721cc
1551c7d1a5e0
hex2dd9540ab8

196919691960 has 256 divisors, whose sum is σ = 626625331200. Its totient is φ = 49446093312.

The previous prime is 196919691953. The next prime is 196919691977. The reversal of 196919691960 is 69196919691.

It is a junction number, because it is equal to n+sod(n) for n = 196919691891 and 196919691900.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 16242781 + ... + 16254899.

It is an arithmetic number, because the mean of its divisors is an integer number (2447755200).

Almost surely, 2196919691960 is an apocalyptic number.

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

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

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

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

196919691960 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 12754584, while the sum is 66.

The spelling of 196919691960 in words is "one hundred ninety-six billion, nine hundred nineteen million, six hundred ninety-one thousand, nine hundred sixty".