Search a number
-
+
302314011133111 is a prime number
BaseRepresentation
bin100010010111100111111011…
…1001111101000010010110111
31110122101221022020010202220021
41010233033313033220102313
5304111103043322224421
62550545050041350011
7120451316006535205
oct10457176717502267
91418357266122807
10302314011133111
1188365719a7a25a
1229aa6592798307
13cc8c1204a41a3
14549210d19c075
1524e3d340cc341
hex112f3f73e84b7

302314011133111 has 2 divisors, whose sum is σ = 302314011133112. Its totient is φ = 302314011133110.

The previous prime is 302314011133081. The next prime is 302314011133139. The reversal of 302314011133111 is 111331110413203.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 302314011133111 - 27 = 302314011132983 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2302314011133111 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 648, while the sum is 25.

Adding to 302314011133111 its reverse (111331110413203), we get a palindrome (413645121546314).

The spelling of 302314011133111 in words is "three hundred two trillion, three hundred fourteen billion, eleven million, one hundred thirty-three thousand, one hundred eleven".