Search a number
-
+
111100100055 = 3571058096191
BaseRepresentation
bin110011101111000010…
…1001111110111010111
3101121202202102211221120
41213132011033313113
53310013111200210
6123012204415023
711012110161150
oct1473605176727
9347682384846
10111100100055
114313212360a
1219647247473
13a6273b4299
14553d34a927
152d5399d270
hex19de14fdd7

111100100055 has 16 divisors (see below), whose sum is σ = 203154468864. Its totient is φ = 50788617120.

The previous prime is 111100099997. The next prime is 111100100081. The reversal of 111100100055 is 550001001111.

It is not a de Polignac number, because 111100100055 - 27 = 111100099927 is a prime.

It is a super-2 number, since 2×1111001000552 (a number of 23 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (15).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 529047991 + ... + 529048200.

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

Almost surely, 2111100100055 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1058096206.

The product of its (nonzero) digits is 25, while the sum is 15.

Adding to 111100100055 its reverse (550001001111), we get a palindrome (661101101166).

The spelling of 111100100055 in words is "one hundred eleven billion, one hundred million, one hundred thousand, fifty-five".

Divisors: 1 3 5 7 15 21 35 105 1058096191 3174288573 5290480955 7406673337 15871442865 22220020011 37033366685 111100100055