Search a number
-
+
301002227231 is a prime number
BaseRepresentation
bin1000110000101010010…
…00010111111000011111
31001202221100210110001012
410120111020113320133
514412423032232411
6350140054205435
730514054500536
oct4302510277037
91052840713035
10301002227231
11106721a01472
124a40505387b
13224cc668784
14107d62ad31d
157c6a68018b
hex4615217e1f

301002227231 has 2 divisors, whose sum is σ = 301002227232. Its totient is φ = 301002227230.

The previous prime is 301002227159. The next prime is 301002227243. The reversal of 301002227231 is 132722200103.

It is a strong prime.

It is an emirp because it is prime and its reverse (132722200103) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 301002227231 - 230 = 299928485407 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 301002227197 and 301002227206.

It is a congruent number.

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

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

Almost surely, 2301002227231 is an apocalyptic number.

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

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

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

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

Adding to 301002227231 its reverse (132722200103), we get a palindrome (433724427334).

The spelling of 301002227231 in words is "three hundred one billion, two million, two hundred twenty-seven thousand, two hundred thirty-one".