Search a number
-
+
10601447957 is a prime number
BaseRepresentation
bin10011101111110010…
…10100001000010101
31000100211111100121122
421313321110020111
5133202432313312
64511545453325
7523466551352
oct116771241025
930324440548
1010601447957
114550271841
12207a4a1245
13ccc4a2139
14727da5629
15420ab4b72
hex277e54215

10601447957 has 2 divisors, whose sum is σ = 10601447958. Its totient is φ = 10601447956.

The previous prime is 10601447953. The next prime is 10601448007. The reversal of 10601447957 is 75974410601.

10601447957 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., 8864975716 + 1736472241 = 94154^2 + 41671^2 .

It is a cyclic number.

It is not a de Polignac number, because 10601447957 - 22 = 10601447953 is a prime.

It is a super-2 number, since 2×106014479572 (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 (10601447951) 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, 5300723978 + 5300723979.

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

Almost surely, 210601447957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 211680, while the sum is 44.

The spelling of 10601447957 in words is "ten billion, six hundred one million, four hundred forty-seven thousand, nine hundred fifty-seven".