Search a number
-
+
1020112200 = 2332521723753
BaseRepresentation
bin111100110011011…
…010110101001000
32122002112001212100
4330303122311020
54042122042300
6245120313400
734164545022
oct7463326510
92562461770
101020112200
11483910438
12245772860
1313345c6b3
14996a5012
155e855700
hex3ccdad48

1020112200 has 432 divisors, whose sum is σ = 3808132380. Its totient is φ = 244408320.

The previous prime is 1020112189. The next prime is 1020112241. The reversal of 1020112200 is 22110201.

It can be written as a sum of positive squares in 18 ways, for example, as 230614596 + 789497604 = 15186^2 + 28098^2 .

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

It is an unprimeable number.

It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 19247374 + ... + 19247426.

Almost surely, 21020112200 is an apocalyptic number.

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

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

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

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

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

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

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

The square root of 1020112200 is about 31939.1953561764. The cubic root of 1020112200 is about 1006.6596177062.

Adding to 1020112200 its reverse (22110201), we get a palindrome (1042222401).

The spelling of 1020112200 in words is "one billion, twenty million, one hundred twelve thousand, two hundred".