Search a number
-
+
1113105200000 = 27558931267
BaseRepresentation
bin10000001100101010001…
…111010111001110000000
310221102010012210220110112
4100030222033113032000
5121214114412400000
62211204203250452
7143263533042503
oct20145217271600
93842105726415
101113105200000
1139a0799597a2
1215b888819a28
1380c71bc15a1
143bc35bb913a
151de4b283235
hex1032a3d7380

1113105200000 has 192 divisors, whose sum is σ = 2802947943600. Its totient is φ = 440225280000.

The previous prime is 1113105199879. The next prime is 1113105200069. The reversal of 1113105200000 is 25013111.

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 35584367 + ... + 35615633.

Almost surely, 21113105200000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 30, while the sum is 14.

The spelling of 1113105200000 in words is "one trillion, one hundred thirteen billion, one hundred five million, two hundred thousand".