Search a number
-
+
110505005657 = 983112416079
BaseRepresentation
bin110011011101010011…
…1001001001001011001
3101120020021122220220022
41212322213021021121
53302303240140112
6122433145440225
710661263023104
oct1467247111131
9346207586808
10110505005657
1142957216362
12194bbaa0075
13a561015517
1454c42bd73b
152d1b5edd72
hex19ba9c9259

110505005657 has 4 divisors (see below), whose sum is σ = 110617422720. Its totient is φ = 110392588596.

The previous prime is 110505005647. The next prime is 110505005659. The reversal of 110505005657 is 756500505011.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 110505005657 - 216 = 110504940121 is a prime.

It is a super-2 number, since 2×1105050056572 (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 (110505005659) 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, 56207057 + ... + 56209022.

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

Almost surely, 2110505005657 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 112417062.

The product of its (nonzero) digits is 26250, while the sum is 35.

The spelling of 110505005657 in words is "one hundred ten billion, five hundred five million, five thousand, six hundred fifty-seven".

Divisors: 1 983 112416079 110505005657