Search a number
-
+
1103112000 = 2633535107
BaseRepresentation
bin100000111000000…
…0010011101000000
32211212200220012000
41001300002131000
54224344041000
6301243304000
736223203654
oct10160023500
92755626160
101103112000
11516750411
1226951b000
131477002c3
14a670ca64
1566c9d000
hex41c02740

1103112000 has 224 divisors, whose sum is σ = 4047987840. Its totient is φ = 294105600.

The previous prime is 1103111857. The next prime is 1103112037. The reversal of 1103112000 is 2113011.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 213447 + ... + 218553.

Almost surely, 21103112000 is an apocalyptic number.

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

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

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

1103112000 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 6, while the sum is 9.

The square root of 1103112000 is about 33213.1299338078. The cubic root of 1103112000 is about 1033.2526703135.

Adding to 1103112000 its reverse (2113011), we get a palindrome (1105225011).

The spelling of 1103112000 in words is "one billion, one hundred three million, one hundred twelve thousand".