Search a number
-
+
20001020113 is a prime number
BaseRepresentation
bin10010101000001001…
…110101100011010001
31220121220110002120201
4102220021311203101
5311430230120423
613104403135201
71305433602664
oct225011654321
956556402521
1020001020113
118534066498
123a62374501
131b69974059
14d7a4ad6db
157c0dbd2ad
hex4a82758d1

20001020113 has 2 divisors, whose sum is σ = 20001020114. Its totient is φ = 20001020112.

The previous prime is 20001020099. The next prime is 20001020147. The reversal of 20001020113 is 31102010002.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 19805495824 + 195524289 = 140732^2 + 13983^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-20001020113 is a prime.

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

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

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

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

Almost surely, 220001020113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 10.

Adding to 20001020113 its reverse (31102010002), we get a palindrome (51103030115).

The spelling of 20001020113 in words is "twenty billion, one million, twenty thousand, one hundred thirteen".