Search a number
-
+
20001310969 is a prime number
BaseRepresentation
bin10010101000001010…
…111100100011111001
31220121220222212120011
4102220022330203321
5311430313422334
613104413301521
71305436223653
oct225012744371
956556885504
1020001310969
118534244a72
123a624948a1
131b69a46563
14d7a5476d3
157c0e29564
hex4a82bc8f9

20001310969 has 2 divisors, whose sum is σ = 20001310970. Its totient is φ = 20001310968.

The previous prime is 20001310961. The next prime is 20001310999. The reversal of 20001310969 is 96901310002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 19927557225 + 73753744 = 141165^2 + 8588^2 .

It is a cyclic number.

It is not a de Polignac number, because 20001310969 - 23 = 20001310961 is a prime.

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

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

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

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

Almost surely, 220001310969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2916, while the sum is 31.

The spelling of 20001310969 in words is "twenty billion, one million, three hundred ten thousand, nine hundred sixty-nine".