Search a number
-
+
10567020091 is a prime number
BaseRepresentation
bin10011101011101011…
…11110111000111011
31000021102201020110111
421311311332320323
5133120124120331
64504315525151
7522601121515
oct116565767073
930242636414
1010567020091
114532897661
12206aa597b7
13cc5309914
147235a2bb5
1541ca63db1
hex275d7ee3b

10567020091 has 2 divisors, whose sum is σ = 10567020092. Its totient is φ = 10567020090.

The previous prime is 10567020083. The next prime is 10567020109. The reversal of 10567020091 is 19002076501.

Together with next prime (10567020109) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10567020091 - 23 = 10567020083 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 210567020091 is an apocalyptic number.

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

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

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

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

Adding to 10567020091 its reverse (19002076501), we get a palindrome (29569096592).

The spelling of 10567020091 in words is "ten billion, five hundred sixty-seven million, twenty thousand, ninety-one".