Search a number
-
+
11303110123313 is a prime number
BaseRepresentation
bin1010010001111011010111…
…0111010001111100110001
31111000120022011211100011212
42210132311313101330301
52440142232142421223
640012324353245505
72244423414545621
oct244366567217461
944016264740155
1011303110123313
113668692aa1958
121326750863895
1363cb566b36c8
142b1105788881
15149046e11278
hexa47b5dd1f31

11303110123313 has 2 divisors, whose sum is σ = 11303110123314. Its totient is φ = 11303110123312.

The previous prime is 11303110123183. The next prime is 11303110123339. The reversal of 11303110123313 is 31332101130311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11083652540944 + 219457582369 = 3329212^2 + 468463^2 .

It is a cyclic number.

It is not a de Polignac number, because 11303110123313 - 28 = 11303110123057 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 211303110123313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 23.

Adding to 11303110123313 its reverse (31332101130311), we get a palindrome (42635211253624).

The spelling of 11303110123313 in words is "eleven trillion, three hundred three billion, one hundred ten million, one hundred twenty-three thousand, three hundred thirteen".