Search a number
-
+
110561111051 = 1093680314869
BaseRepresentation
bin110011011110111110…
…1001010110000001011
3101120101012020101000212
41212331331022300023
53302412121023201
6122442512151335
710662543636506
oct1467575126013
9346335211025
10110561111051
1142985957156
121951683854b
13a56c82a891
1454cb92613d
152d214d2abb
hex19bdf4ac0b

110561111051 has 8 divisors (see below), whose sum is σ = 110685975120. Its totient is φ = 110436292512.

The previous prime is 110561111041. The next prime is 110561111053. The reversal of 110561111051 is 150111165011.

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 110561111051 - 210 = 110561110027 is a prime.

It is a Duffinian number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7428245 + ... + 7443113.

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

Almost surely, 2110561111051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 22765.

The product of its (nonzero) digits is 150, while the sum is 23.

Adding to 110561111051 its reverse (150111165011), we get a palindrome (260672276062).

The spelling of 110561111051 in words is "one hundred ten billion, five hundred sixty-one million, one hundred eleven thousand, fifty-one".

Divisors: 1 1093 6803 14869 7435679 16251817 101153807 110561111051