Search a number
-
+
101220110200 = 235211538310459
BaseRepresentation
bin101111001000100110…
…0000100111101111000
3100200021012111100210101
41132101030010331320
53124244322011300
6114255550125144
710212220512046
oct1362114047570
9320235440711
10101220110200
1139a22127a40
121774a4b07b4
139711525541
144c83107396
1529763e8b6a
hex1791304f78

101220110200 has 192 divisors, whose sum is σ = 264751804800. Its totient is φ = 35674329600.

The previous prime is 101220110179. The next prime is 101220110219. The reversal of 101220110200 is 2011022101.

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 9672571 + ... + 9683029.

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

Almost surely, 2101220110200 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101220110200 its reverse (2011022101), we get a palindrome (103231132301).

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