Search a number
-
+
1101111201110 = 25269409335019
BaseRepresentation
bin10000000001011111010…
…101111000110101010110
310220021011022222122002102
4100001133111320311112
5121020033431413420
62201502110242102
7142360363531634
oct20013725706526
93807138878072
101101111201110
11394a84626918
1215949bab6332
137cab007b41b
143b418cc0354
151d9982eaa75
hex1005f578d56

1101111201110 has 16 divisors (see below), whose sum is σ = 1989368197200. Its totient is φ = 438807139296.

The previous prime is 1101111201101. The next prime is 1101111201139. The reversal of 1101111201110 is 111021111011.

It is a happy number.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 21101111201110 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 409335295.

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

Adding to 1101111201110 its reverse (111021111011), we get a palindrome (1212132312121).

Subtracting from 1101111201110 its reverse (111021111011), we obtain a palindrome (990090090099).

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

Divisors: 1 2 5 10 269 538 1345 2690 409335019 818670038 2046675095 4093350190 110111120111 220222240222 550555600555 1101111201110