Search a number
-
+
100010010111102 = 232713237887143107
BaseRepresentation
bin10110101111010101100101…
…001000000110110001111110
3111010002212022120002212020100
4112233111211020012301332
5101102031000042023402
6552411544150101530
730031325165525520
oct2657254510066176
9433085276085210
10100010010111102
11299590094a7873
12b27273a04a8a6
1343a5b98c63700
141a9a720447a10
15b867534c871c
hex5af565206c7e

100010010111102 has 288 divisors, whose sum is σ = 275718659553792. Its totient is φ = 25634282409216.

The previous prime is 100010010111079. The next prime is 100010010111127. The reversal of 100010010111102 is 201111010010001.

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 143 ways as a sum of consecutive naturals, for example, 698776233 + ... + 698919339.

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

Almost surely, 2100010010111102 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 100010010111102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (137859329776896).

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

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

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

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

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

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

Adding to 100010010111102 its reverse (201111010010001), we get a palindrome (301121020121103).

The spelling of 100010010111102 in words is "one hundred trillion, ten billion, ten million, one hundred eleven thousand, one hundred two".