Search a number
-
+
196809312000 = 2835372910099
BaseRepresentation
bin1011011101001010111…
…1111100011100000000
3200210222222102221101210
42313102233330130000
511211031140441000
6230225110330120
720135055356430
oct2672257743400
9623888387353
10196809312000
11765147a9074
1232187059940
1315736291002
14975043c2c0
1551bd2b5350
hex2dd2bfc700

196809312000 has 576 divisors, whose sum is σ = 772926336000. Its totient is φ = 43429478400.

The previous prime is 196809311989. The next prime is 196809312019. The reversal of 196809312000 is 213908691.

It is a self number, because there is not a number n which added to its sum of digits gives 196809312000.

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, 19482951 + ... + 19493049.

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

Almost surely, 2196809312000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 23328, while the sum is 39.

The spelling of 196809312000 in words is "one hundred ninety-six billion, eight hundred nine million, three hundred twelve thousand".