Search a number
-
+
111061066027 = 432582815489
BaseRepresentation
bin110011101101111000…
…0010110000100101011
3101121200000222201022211
41213123300112010223
53304423113103102
6123004252025551
711011124325262
oct1473360260453
9347600881284
10111061066027
114311209278a
12196361622b7
13a61c298322
1455380a95d9
152d5033c7d7
hex19dbc1612b

111061066027 has 4 divisors (see below), whose sum is σ = 113643881560. Its totient is φ = 108478250496.

The previous prime is 111061066019. The next prime is 111061066033. The reversal of 111061066027 is 720660160111.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 720660160111 = 3831881619217.

It is a cyclic number.

It is not a de Polignac number, because 111061066027 - 23 = 111061066019 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 111061066027.

It is not an unprimeable number, because it can be changed into a prime (111061066097) 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, 1291407702 + ... + 1291407787.

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

Almost surely, 2111061066027 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2582815532.

The product of its (nonzero) digits is 3024, while the sum is 31.

The spelling of 111061066027 in words is "one hundred eleven billion, sixty-one million, sixty-six thousand, twenty-seven".

Divisors: 1 43 2582815489 111061066027