Search a number
-
+
101111000110110 = 233517236911386053
BaseRepresentation
bin10110111111010110111101…
…001111101001010000011110
3111021000010011110000210022000
4112333112331033221100132
5101223100312012010420
6555013430250503130
730204012561231534
oct2677267517512036
9437003143023260
10101111000110110
112a242a30670761
12b40bba5434aa6
134455959b869c3
141ad7b271b8154
15ba51e0d32690
hex5bf5bd3e941e

101111000110110 has 256 divisors, whose sum is σ = 298333819422720. Its totient is φ = 24238390302720.

The previous prime is 101111000110069. The next prime is 101111000110111. The reversal of 101111000110110 is 11011000111101.

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 = 101111000110092 and 101111000110101.

It is a congruent number.

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

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

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 72255844 + ... + 73641896.

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

Almost surely, 2101111000110110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101111000110110 its reverse (11011000111101), we get a palindrome (112122000221211).

Subtracting from 101111000110110 its reverse (11011000111101), we obtain a palindrome (90099999999009).

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