Search a number
-
+
5110466261209 is a prime number
BaseRepresentation
bin100101001011101111110…
…0001101011000011011001
3200002120000011212121220221
41022113133201223003121
51132212213330324314
614511414335520041
71035135055326541
oct112273741530331
920076004777827
105110466261209
1116a0377a7a611
126a6538989021
132b0bb806257a
141394c285c321
158ce0571a824
hex4a5df86b0d9

5110466261209 has 2 divisors, whose sum is σ = 5110466261210. Its totient is φ = 5110466261208.

The previous prime is 5110466261119. The next prime is 5110466261237. The reversal of 5110466261209 is 9021626640115.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 3077480775625 + 2032985485584 = 1754275^2 + 1425828^2 .

It is a cyclic number.

It is not a de Polignac number, because 5110466261209 - 27 = 5110466261081 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (5110466261249) 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, 2555233130604 + 2555233130605.

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

Almost surely, 25110466261209 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 155520, while the sum is 43.

The spelling of 5110466261209 in words is "five trillion, one hundred ten billion, four hundred sixty-six million, two hundred sixty-one thousand, two hundred nine".