Search a number
-
+
20091312569 is a prime number
BaseRepresentation
bin10010101101100010…
…010001100110111001
31220212012100102112202
4102231202101212321
5312121334000234
613121350315545
71310611224206
oct225542214671
956765312482
1020091312569
118580027559
123a88658bb5
131b82599143
14d88494cad
157c8ca677e
hex4ad8919b9

20091312569 has 2 divisors, whose sum is σ = 20091312570. Its totient is φ = 20091312568.

The previous prime is 20091312547. The next prime is 20091312599. The reversal of 20091312569 is 96521319002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10322560000 + 9768752569 = 101600^2 + 98837^2 .

It is a cyclic number.

It is not a de Polignac number, because 20091312569 - 220 = 20090263993 is a prime.

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

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

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

Almost surely, 220091312569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29160, while the sum is 38.

The spelling of 20091312569 in words is "twenty billion, ninety-one million, three hundred twelve thousand, five hundred sixty-nine".