Search a number
-
+
1011101110110 = 2325713373379901
BaseRepresentation
bin11101011011010100101…
…00101000111101011110
310120122211101010020201100
432231222110220331132
5113031213341010420
62052254325453530
7133023012426360
oct16555224507536
93518741106640
101011101110110
1135a895243263
12143b5b8712a6
1374467135050
1436d1a916d30
151b47b129190
hexeb6a528f5e

1011101110110 has 384 divisors, whose sum is σ = 3333167195904. Its totient is φ = 206928691200.

The previous prime is 1011101110069. The next prime is 1011101110111. The reversal of 1011101110110 is 110111011101.

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 = 1011101110092 and 1011101110101.

It is a congruent number.

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

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

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 102116160 + ... + 102126060.

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

Almost surely, 21011101110110 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 1011101110110 its reverse (110111011101), we get a palindrome (1121212121211).

Subtracting from 1011101110110 its reverse (110111011101), we obtain a palindrome (900990099009).

It can be divided in two parts, 1011101 and 110110, that added together give a palindrome (1121211).

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