Search a number
-
+
10020111509 is a prime number
BaseRepresentation
bin10010101010011111…
…01100010010010101
3221212022121101221002
421111033230102111
5131010122032014
64334141433045
7503210354042
oct112517542225
927768541832
1010020111509
1142821010a1
121b3786b785
13c38c0c585
146b0aba1c9
153d9a31dde
hex2553ec495

10020111509 has 2 divisors, whose sum is σ = 10020111510. Its totient is φ = 10020111508.

The previous prime is 10020111463. The next prime is 10020111511. The reversal of 10020111509 is 90511102001.

10020111509 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8081470609 + 1938640900 = 89897^2 + 44030^2 .

It is a cyclic number.

It is not a de Polignac number, because 10020111509 - 212 = 10020107413 is a prime.

Together with 10020111511, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 210020111509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 90, while the sum is 20.

The spelling of 10020111509 in words is "ten billion, twenty million, one hundred eleven thousand, five hundred nine".