195761111040 has 896 divisors, whose sum is σ = 773601354000. Its totient is φ = 47138734080.

The previous prime is 195761111027. The next prime is 195761111071. The reversal of 195761111040 is 40111167591.

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

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

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (11) of ones.

It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 1313832886 + ... + 1313833034.

Almost surely, 2^195761111040 is an apocalyptic number.

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

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

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

195761111040 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 7560, while the sum is 36.

The spelling of 195761111040 in words is "one hundred ninety-five billion, seven hundred sixty-one million, one hundred eleven thousand, forty".