Search a number
-
+
20035051321 is a prime number
BaseRepresentation
bin10010101010001011…
…101001111100111001
31220201021111001121211
4102222023221330321
5312012433120241
613112020403121
71306326061225
oct225213517471
956637431554
1020035051321
11855129a65a
123a718464a1
131b73a2ab6c
14d80c0b785
157c3d91781
hex4aa2e9f39

20035051321 has 2 divisors, whose sum is σ = 20035051322. Its totient is φ = 20035051320.

The previous prime is 20035051279. The next prime is 20035051343. The reversal of 20035051321 is 12315053002.

It is an a-pointer prime, because the next prime (20035051343) can be obtained adding 20035051321 to its sum of digits (22).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 19960038400 + 75012921 = 141280^2 + 8661^2 .

It is a cyclic number.

It is not a de Polignac number, because 20035051321 - 27 = 20035051193 is a prime.

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

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

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

Almost surely, 220035051321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 22.

The spelling of 20035051321 in words is "twenty billion, thirty-five million, fifty-one thousand, three hundred twenty-one".