Search a number
-
+
1060111556531 is a prime number
BaseRepresentation
bin11110110110100111001…
…00101001111110110011
310202100022222220220000122
433123103210221332303
5114332102024302111
62131001501440455
7136406360360306
oct17332344517663
93670288826018
101060111556531
11379655378035
1215155927012b
1378c77b846c1
1439449a58b3d
151c898ba2cdb
hexf6d3929fb3

1060111556531 has 2 divisors, whose sum is σ = 1060111556532. Its totient is φ = 1060111556530.

The previous prime is 1060111556513. The next prime is 1060111556611. The reversal of 1060111556531 is 1356551110601.

Together with previous prime (1060111556513) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1060111556531 - 218 = 1060111294387 is a prime.

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

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

It is not a weakly prime, because it can be changed into another prime (1060111552531) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 530055778265 + 530055778266.

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

Almost surely, 21060111556531 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 13500, while the sum is 35.

The spelling of 1060111556531 in words is "one trillion, sixty billion, one hundred eleven million, five hundred fifty-six thousand, five hundred thirty-one".