Search a number
BaseRepresentation
bin10110111101111000111111…
…001100011110001000110110
3111020122110201121202001112200
4112331320333030132020312
5101214422141340213420
6554455222210525330
730163511316632535
oct2675707714361066
9436573647661480
10101010101101110
112a20416381a913
12b3b4526596846
13444929a039996
15ba2787c14b90
hex5bde3f31e236

101010101101110 has 72 divisors (see below), whose sum is σ = 262950646420800. Its totient is φ = 26902797844320.

The previous prime is 101010101101043. The next prime is 101010101101121. The reversal of 101010101101110 is 11101101010101.

Adding to 101010101101110 its reverse (11101101010101), we get a palindrome (112111202111211).

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 = 101010101101092 and 101010101101101.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 58341691 + ... + 60048089.

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

Almost surely, 2101010101101110 is an apocalyptic number.

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

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

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

101010101101110 is an equidigital number, since it uses as much as digits as its factorization.

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

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

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

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