Search a number
-
+
1130210350471 is a prime number
BaseRepresentation
bin10000011100100101110…
…010010101010110000111
311000001021022011120201001
4100130211302111112013
5122004132322203341
62223113402114131
7144440444320036
oct20344562252607
94001238146631
101130210350471
113a6357307494
121630611ab947
138276990c8b7
143c9b982a71d
151e5ecccad31
hex10725c95587

1130210350471 has 2 divisors, whose sum is σ = 1130210350472. Its totient is φ = 1130210350470.

The previous prime is 1130210350441. The next prime is 1130210350499. The reversal of 1130210350471 is 1740530120311.

It is an a-pointer prime, because the next prime (1130210350499) can be obtained adding 1130210350471 to its sum of digits (28).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1130210350471 - 217 = 1130210219399 is a prime.

It is a super-3 number, since 3×11302103504713 (a number of 37 digits) contains 333 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 21130210350471 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2520, while the sum is 28.

Adding to 1130210350471 its reverse (1740530120311), we get a palindrome (2870740470782).

The spelling of 1130210350471 in words is "one trillion, one hundred thirty billion, two hundred ten million, three hundred fifty thousand, four hundred seventy-one".