Search a number
-
+
10606561997 is a prime number
BaseRepresentation
bin10011110000011001…
…10100101011001101
31000101012010011202112
421320030310223031
5133210234440442
64512251233405
7523561201163
oct117014645315
930335104675
1010606561997
114553145019
122080148865
131000572ab5
14728937233
15421275082
hex278334acd

10606561997 has 2 divisors, whose sum is σ = 10606561998. Its totient is φ = 10606561996.

The previous prime is 10606561981. The next prime is 10606562009. The reversal of 10606561997 is 79916560601.

10606561997 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., 10558384516 + 48177481 = 102754^2 + 6941^2 .

It is a cyclic number.

It is not a de Polignac number, because 10606561997 - 24 = 10606561981 is a prime.

It is a super-2 number, since 2×106065619972 (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 (10606561907) 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, 5303280998 + 5303280999.

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

Almost surely, 210606561997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 612360, while the sum is 50.

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