Search a number
-
+
110565556053 = 3355910355489
BaseRepresentation
bin110011011111000111…
…0000111111101010101
3101120101111121012102120
41212332032013331111
53302414240243203
6122443151330153
710662626501631
oct1467616077525
9346344535376
10110565556053
1142988412807
1219518220959
13a570725b64
1454cc361dc1
152d21aaeb53
hex19be387f55

110565556053 has 8 divisors (see below), whose sum is σ = 147462177600. Its totient is φ = 73689652608.

The previous prime is 110565556007. The next prime is 110565556061. The reversal of 110565556053 is 350655565011.

It is a happy number.

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

It is not a de Polignac number, because 110565556053 - 28 = 110565555797 is a prime.

It is a Curzon number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2110565556053 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10359051.

The product of its (nonzero) digits is 337500, while the sum is 42.

The spelling of 110565556053 in words is "one hundred ten billion, five hundred sixty-five million, five hundred fifty-six thousand, fifty-three".

Divisors: 1 3 3559 10677 10355489 31066467 36855185351 110565556053