Search a number
-
+
302001113321 is a prime number
BaseRepresentation
bin1000110010100001010…
…10110100100011101001
31001212111222101010011022
410121100222310203221
514421444241111241
6350423135542225
730550604052065
oct4312052644351
91055458333138
10302001113321
11107094834366
124a64368a975
132262b5a592b
141088cc0aaa5
157cc81e154b
hex4650ab48e9

302001113321 has 2 divisors, whose sum is σ = 302001113322. Its totient is φ = 302001113320.

The previous prime is 302001113317. The next prime is 302001113327. The reversal of 302001113321 is 123311100203.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 193736424025 + 108264689296 = 440155^2 + 329036^2 .

It is a cyclic number.

It is not a de Polignac number, because 302001113321 - 22 = 302001113317 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

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

Almost surely, 2302001113321 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 302001113321 its reverse (123311100203), we get a palindrome (425312213524).

The spelling of 302001113321 in words is "three hundred two billion, one million, one hundred thirteen thousand, three hundred twenty-one".