11967140 has 48 divisors (see below), whose sum is σ = 26611200. Its totient is φ = 4513152.

The previous prime is 11967139. The next prime is 11967149. The reversal of 11967140 is 4176911.

11967140 = T₃₉₅ + T₃₉₆ + ... + T₅₁₀.

11967140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is not an unprimeable number, because it can be changed into a prime (11967149) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27041 + ... + 27479.

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

Almost surely, 2^11967140 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 1512, while the sum is 29.

The square root of 11967140 is about 3459.3554312906. The cubic root of 11967140 is about 228.7336835287.

The spelling of 11967140 in words is "eleven million, nine hundred sixty-seven thousand, one hundred forty".