Search a number
-
+
111935116051 = 1110175919641
BaseRepresentation
bin110100000111111011…
…0100101001100010011
3101200220221200001112221
41220033312211030103
53313220342203201
6123231114001511
711041566534133
oct1501766451423
9350827601487
10111935116051
1143520500480
121983aa16297
13a72b3a72a5
1455bc1ccac3
152da1e404a1
hex1a0fda5313

111935116051 has 4 divisors (see below), whose sum is σ = 122111035704. Its totient is φ = 101759196400.

The previous prime is 111935116031. The next prime is 111935116079. The reversal of 111935116051 is 150611539111.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 111935116051 - 27 = 111935115923 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (111935116001) 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 3 ways as a sum of consecutive naturals, for example, 5087959810 + ... + 5087959831.

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

Almost surely, 2111935116051 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 10175919652.

The product of its (nonzero) digits is 4050, while the sum is 34.

The spelling of 111935116051 in words is "one hundred eleven billion, nine hundred thirty-five million, one hundred sixteen thousand, fifty-one".

Divisors: 1 11 10175919641 111935116051