Search a number
-
+
10660501961 is a prime number
BaseRepresentation
bin10011110110110101…
…00101100111001001
31000111221121121110222
421323122211213021
5133313042030321
64521455315425
7525114525434
oct117332454711
930457547428
1010660501961
1145806369aa
12209621bb75
13100b7aa635
14731b7881b
15425d7c3ab
hex27b6a59c9

10660501961 has 2 divisors, whose sum is σ = 10660501962. Its totient is φ = 10660501960.

The previous prime is 10660501949. The next prime is 10660501997. The reversal of 10660501961 is 16910506601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10485760000 + 174741961 = 102400^2 + 13219^2 .

It is a cyclic number.

It is not a de Polignac number, because 10660501961 - 26 = 10660501897 is a prime.

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

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

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

Almost surely, 210660501961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9720, while the sum is 35.

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