Search a number
-
+
10310312003111 is a prime number
BaseRepresentation
bin1001011000001000111001…
…1111000000011000100111
31100111122201101000022111122
42112002032133000120213
52322411004333044421
633532254132124155
72112616100012651
oct226021637003047
940448641008448
1010310312003111
11331564037793a
1211a625a76665b
1359a3484b5903
14279043a0d6d1
1512d2dca902ab
hex9608e7c0627

10310312003111 has 2 divisors, whose sum is σ = 10310312003112. Its totient is φ = 10310312003110.

The previous prime is 10310312003053. The next prime is 10310312003143. The reversal of 10310312003111 is 11130021301301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10310312003111 - 222 = 10310307808807 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10310312003111.

It is a congruent number.

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

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

Almost surely, 210310312003111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 54, while the sum is 17.

Adding to 10310312003111 its reverse (11130021301301), we get a palindrome (21440333304412).

The spelling of 10310312003111 in words is "ten trillion, three hundred ten billion, three hundred twelve million, three thousand, one hundred eleven".