Search a number
-
+
110050600051 = 715721514293
BaseRepresentation
bin110011001111110000…
…1101110010001110011
3101112001121121201121001
41212133201232101303
53300340423200201
6122320114142431
710644104444320
oct1463741562163
9345047551531
10110050600051
1142743770737
12193b3881a17
13a4bab35472
14547dbd5b47
152ce1790301
hex199f86e473

110050600051 has 4 divisors (see below), whose sum is σ = 125772114352. Its totient is φ = 94329085752.

The previous prime is 110050600039. The next prime is 110050600081. The reversal of 110050600051 is 150006050011.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 150006050011 = 169007887573.

It is a cyclic number.

It is not a de Polignac number, because 110050600051 - 29 = 110050599539 is a prime.

It is a super-2 number, since 2×1100506000512 (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 (110050600081) 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, 7860757140 + ... + 7860757153.

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

Almost surely, 2110050600051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 15721514300.

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

Adding to 110050600051 its reverse (150006050011), we get a palindrome (260056650062).

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

Divisors: 1 7 15721514293 110050600051