Search a number
-
+
20110309573 is a prime number
BaseRepresentation
bin10010101110101010…
…101111100011000101
31220220112002120112111
4102232222233203011
5312141214401243
613123305421021
71311231545104
oct225652574305
956815076474
1020110309573
11858a822262
123a92a9a771
131b864bab83
14d8abdc03b
157ca7aa39d
hex4aeaaf8c5

20110309573 has 2 divisors, whose sum is σ = 20110309574. Its totient is φ = 20110309572.

The previous prime is 20110309567. The next prime is 20110309603. The reversal of 20110309573 is 37590301102.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 19519722369 + 590587204 = 139713^2 + 24302^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

Almost surely, 220110309573 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 20110309573 in words is "twenty billion, one hundred ten million, three hundred nine thousand, five hundred seventy-three".