Search a number
-
+
111101006051 = 731831761559
BaseRepresentation
bin110011101111000100…
…0101101000011100011
3101121202211010212201222
41213132020231003203
53310013324143201
6123012240045255
711012120653430
oct1473610550343
9347684125658
10111101006051
1143132692272
121964760382b
13a627640789
14553d504b87
152d53acb91b
hex19de22d0e3

111101006051 has 16 divisors (see below), whose sum is σ = 131086356480. Its totient is φ = 92144939040.

The previous prime is 111101006039. The next prime is 111101006059. The reversal of 111101006051 is 150600101111.

It is not a de Polignac number, because 111101006051 - 210 = 111101005027 is a prime.

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

It is a Duffinian number.

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

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

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

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

Almost surely, 2111101006051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 69914.

The product of its (nonzero) digits is 30, while the sum is 17.

Adding to 111101006051 its reverse (150600101111), we get a palindrome (261701107162).

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

Divisors: 1 7 31 217 8317 58219 61559 257827 430913 1804789 1908329 13358303 511986203 3583903421 15871572293 111101006051