Search a number
-
+
10719591073 is a prime number
BaseRepresentation
bin10011111101110111…
…11111101010100001
31000200001210122111121
421332323333222201
5133423203403243
64531410012241
7526433010052
oct117673775241
930601718447
1010719591073
114600a25484
1220b1b77081
13101aac8ac9
1473995a729
1542b1501ed
hex27eeffaa1

10719591073 has 2 divisors, whose sum is σ = 10719591074. Its totient is φ = 10719591072.

The previous prime is 10719591037. The next prime is 10719591079. The reversal of 10719591073 is 37019591701.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7501638544 + 3217952529 = 86612^2 + 56727^2 .

It is a cyclic number.

It is not a de Polignac number, because 10719591073 - 29 = 10719590561 is a prime.

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

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

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

Almost surely, 210719591073 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 59535, while the sum is 43.

The spelling of 10719591073 in words is "ten billion, seven hundred nineteen million, five hundred ninety-one thousand, seventy-three".