Search a number
-
+
403020114281 is a prime number
BaseRepresentation
bin1011101110101011101…
…11101110100101101001
31102112021011110001221022
411313111313232211221
523100341122124111
6505051143422225
741055133306631
oct5672567564551
91375234401838
10403020114281
11145a13390a14
1266136754975
132c00a246005
14157133236c1
15a73bb122db
hex5dd5dee969

403020114281 has 2 divisors, whose sum is σ = 403020114282. Its totient is φ = 403020114280.

The previous prime is 403020114239. The next prime is 403020114311. The reversal of 403020114281 is 182411020304.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 345367782400 + 57652331881 = 587680^2 + 240109^2 .

It is a cyclic number.

It is not a de Polignac number, because 403020114281 - 234 = 385840245097 is a prime.

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

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 403020114281.

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

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

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

Almost surely, 2403020114281 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1536, while the sum is 26.

Adding to 403020114281 its reverse (182411020304), we get a palindrome (585431134585).

The spelling of 403020114281 in words is "four hundred three billion, twenty million, one hundred fourteen thousand, two hundred eighty-one".