Search a number
-
+
105055511110559 = 281124137369799
BaseRepresentation
bin10111111000110000100100…
…011010111110001110011111
3111202222012122012101020202122
4113320300210122332032133
5102232212141321014214
61011233500251013155
731062003333435032
oct2770604432761637
9452865565336678
10105055511110559
1130523879259709
12b94856613a1bb
1346808cc980a99
141bd29dcbd5019
15c22b055ec88e
hex5f8c246be39f

105055511110559 has 4 divisors (see below), whose sum is σ = 105055551291600. Its totient is φ = 105055470929520.

The previous prime is 105055511110483. The next prime is 105055511110567. The reversal of 105055511110559 is 955011115550501.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-105055511110559 is a prime.

It is a super-2 number, since 2×1050555111105592 (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15873659 + ... + 21496140.

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

Almost surely, 2105055511110559 is an apocalyptic number.

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

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

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

The sum of its prime factors is 40181040.

The product of its (nonzero) digits is 140625, while the sum is 44.

The spelling of 105055511110559 in words is "one hundred five trillion, fifty-five billion, five hundred eleven million, one hundred ten thousand, five hundred fifty-nine".

Divisors: 1 2811241 37369799 105055511110559