Search a number
-
+
10709862769 is a prime number
BaseRepresentation
bin10011111100101101…
…11000100101110001
31000122101111101210001
421332112320211301
5133413211102034
64530421310001
7526254221464
oct117626704561
930571441701
1010709862769
1145a6490461
1220aa865301
131018aa0b08
147385472db
1542a37ca14
hex27e5b8971

10709862769 has 2 divisors, whose sum is σ = 10709862770. Its totient is φ = 10709862768.

The previous prime is 10709862697. The next prime is 10709862887. The reversal of 10709862769 is 96726890701.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10612090225 + 97772544 = 103015^2 + 9888^2 .

It is a cyclic number.

It is not a de Polignac number, because 10709862769 - 29 = 10709862257 is a prime.

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

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

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

Almost surely, 210709862769 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2286144, while the sum is 55.

The spelling of 10709862769 in words is "ten billion, seven hundred nine million, eight hundred sixty-two thousand, seven hundred sixty-nine".