Search a number
-
+
11404610301523 is a prime number
BaseRepresentation
bin1010010111110101011110…
…1111101110111001010011
31111101021021220022122001111
42211331113233232321103
52443323120214122043
640131112230314151
72254645606043545
oct245752757567123
944337256278044
1011404610301523
1136a773921a05a
121342358ab8957
136495b0c4855a
142b5db3b57695
1514b9d7bcd09d
hexa5f57beee53

11404610301523 has 2 divisors, whose sum is σ = 11404610301524. Its totient is φ = 11404610301522.

The previous prime is 11404610301451. The next prime is 11404610301541. The reversal of 11404610301523 is 32510301640411.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11404610301523 is a prime.

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

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

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

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

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

Almost surely, 211404610301523 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8640, while the sum is 31.

Adding to 11404610301523 its reverse (32510301640411), we get a palindrome (43914911941934).

The spelling of 11404610301523 in words is "eleven trillion, four hundred four billion, six hundred ten million, three hundred one thousand, five hundred twenty-three".