11031900 has 72 divisors (see below), whose sum is σ = 34831104. Its totient is φ = 2673600.

The previous prime is 11031893. The next prime is 11031931. The reversal of 11031900 is 913011.

It is a super-2 number, since 2×11031900² = 243405635220000, which contains 22 as substring.

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

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

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 23 ways as a sum of consecutive naturals, for example, 1629 + ... + 4971.

Almost surely, 2^11031900 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 11031900 is about 3321.4304147460. The cubic root of 11031900 is about 222.6127863146.

Adding to 11031900 its reverse (913011), we get a palindrome (11944911).

It can be divided in two parts, 1103 and 1900, that added together give a palindrome (3003).

The spelling of 11031900 in words is "eleven million, thirty-one thousand, nine hundred".