Search a number
-
+
6011050111597 is a prime number
BaseRepresentation
bin101011101111000111010…
…0000011011001001101101
3210021122120102021101022201
41113132032200123021231
51241441112312032342
620441234401141501
71160166265625026
oct127361640331155
923248512241281
106011050111597
111a082aa097893
12810b9462a891
13347abb78157b
1416ad175c5c4d
15a6564124db7
hex5778e81b26d

6011050111597 has 2 divisors, whose sum is σ = 6011050111598. Its totient is φ = 6011050111596.

The previous prime is 6011050111559. The next prime is 6011050111621. The reversal of 6011050111597 is 7951110501106.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5984965923561 + 26084188036 = 2446419^2 + 161506^2 .

It is a cyclic number.

It is not a de Polignac number, because 6011050111597 - 223 = 6011041722989 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (6011050112597) 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 as a sum of consecutive naturals, namely, 3005525055798 + 3005525055799.

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

Almost surely, 26011050111597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 37.

The spelling of 6011050111597 in words is "six trillion, eleven billion, fifty million, one hundred eleven thousand, five hundred ninety-seven".