Search a number
-
+
100111011101010 = 232571337615479901
BaseRepresentation
bin10110110000110011101001…
…010000010011100101010010
3111010110112000111021202111100
4112300303221100103211102
5101110204322320213020
6552530210311525230
730041532116010120
oct2660635120234522
9433415014252440
10100111011101010
1129997928972458
12b28a227089816
1343b2573c68a70
141aa15823d2910
15b891b553ca90
hex5b0ce9413952

100111011101010 has 768 divisors, whose sum is σ = 335052333278208. Its totient is φ = 20175547392000.

The previous prime is 100111011101009. The next prime is 100111011101011. The reversal of 100111011101010 is 10101110111001.

It is an interprime number because it is at equal distance from previous prime (100111011101009) and next prime (100111011101011).

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

It is a junction number, because it is equal to n+sod(n) for n = 100111011100983 and 100111011101001.

It is not an unprimeable number, because it can be changed into a prime (100111011101011) by changing a digit.

It is a polite number, since it can be written in 383 ways as a sum of consecutive naturals, for example, 10111197060 + ... + 10111206960.

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

Almost surely, 2100111011101010 is an apocalyptic number.

100111011101010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

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

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

Adding to 100111011101010 its reverse (10101110111001), we get a palindrome (110212121212011).

Subtracting from 100111011101010 its reverse (10101110111001), we obtain a palindrome (90009900990009).

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