Search a number
-
+
20035201961 is a prime number
BaseRepresentation
bin10010101010001100…
…001110101110101001
31220201021202201021002
4102222030032232221
5312013002430321
613112023524345
71306330256345
oct225214165651
956637681232
1020035201961
118551392855
123a718b96b5
131b73a815b8
14d80c4a625
157c3dc120b
hex4aa30eba9

20035201961 has 2 divisors, whose sum is σ = 20035201962. Its totient is φ = 20035201960.

The previous prime is 20035201937. The next prime is 20035202003. The reversal of 20035201961 is 16910253002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11436163600 + 8599038361 = 106940^2 + 92731^2 .

It is a cyclic number.

It is not a de Polignac number, because 20035201961 - 226 = 19968093097 is a prime.

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

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

Almost surely, 220035201961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 29.

Adding to 20035201961 its reverse (16910253002), we get a palindrome (36945454963).

The spelling of 20035201961 in words is "twenty billion, thirty-five million, two hundred one thousand, nine hundred sixty-one".