Search a number
-
+
111056050101097 = 239749778597087
BaseRepresentation
bin11001010000000101000000…
…011010101001101101101001
3112120012212002002010100200101
4121100011000122221231221
5104024020242311213342
61032110240050305401
732251351310335213
oct3120050032515551
9476185062110611
10111056050101097
1132427674069692
12105574a6588261
1349c7704897b9a
141d5d1da4095b3
15cc8c51a513b7
hex6501406a9b69

111056050101097 has 8 divisors (see below), whose sum is σ = 117079260350976. Its totient is φ = 105132397045632.

The previous prime is 111056050101091. The next prime is 111056050101133. The reversal of 111056050101097 is 790101050650111.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 111056050101097 - 27 = 111056050100969 is a prime.

It is a Duffinian number.

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

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

Almost surely, 2111056050101097 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 49778597207.

The product of its (nonzero) digits is 9450, while the sum is 37.

The spelling of 111056050101097 in words is "one hundred eleven trillion, fifty-six billion, fifty million, one hundred one thousand, ninety-seven".

Divisors: 1 23 97 2231 49778597087 1144907733001 4828523917439 111056050101097