Search a number
-
+
10605554969 is a prime number
BaseRepresentation
bin10011110000010001…
…11110110100011001
31000101010020000101012
421320020332310121
5133210010224334
64512213503305
7523546505222
oct117010766431
930333200335
1010605554969
114552617469
12207b941b35
1310002ac619
14728754249
154211269ce
hex27823ed19

10605554969 has 2 divisors, whose sum is σ = 10605554970. Its totient is φ = 10605554968.

The previous prime is 10605554963. The next prime is 10605555011. The reversal of 10605554969 is 96945550601.

It is a happy number.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5374649344 + 5230905625 = 73312^2 + 72325^2 .

It is a cyclic number.

It is not a de Polignac number, because 10605554969 - 212 = 10605550873 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 210605554969 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10605554969 in words is "ten billion, six hundred five million, five hundred fifty-four thousand, nine hundred sixty-nine".