Search a number
-
+
1000110020110 = 25591695101729
BaseRepresentation
bin11101000110110110011…
…00111101011000001110
310112121110101110000200221
432203123030331120032
5112341211131120420
62043235540341554
7132153441623245
oct16433314753016
93477411400627
101000110020110
11356165040703
121419b29a48ba
137340500a0b6
1436596cc595c
151b036249caa
hexe8db33d60e

1000110020110 has 16 divisors (see below), whose sum is σ = 1830709868400. Its totient is φ = 393263600896.

The previous prime is 1000110020071. The next prime is 1000110020113. The reversal of 1000110020110 is 110200110001.

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

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 847550275 + ... + 847551454.

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

Almost surely, 21000110020110 is an apocalyptic number.

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

1000110020110 is a deficient number, since it is larger than the sum of its proper divisors (830599848290).

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

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

The sum of its prime factors is 1695101795.

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

Adding to 1000110020110 its reverse (110200110001), we get a palindrome (1110310130111).

The spelling of 1000110020110 in words is "one trillion, one hundred ten million, twenty thousand, one hundred ten".

Divisors: 1 2 5 10 59 118 295 590 1695101729 3390203458 8475508645 16951017290 100011002011 200022004022 500055010055 1000110020110