Search a number
-
+
10607321047 is a prime number
BaseRepresentation
bin10011110000011111…
…01101111111010111
31000101020112201222111
421320033231333113
5133210433233142
64512315411451
7523600512151
oct117017557727
930336481874
1010607321047
114553613334
122080453b87
13100077a43b
14728a93ad1
15421374e17
hex2783edfd7

10607321047 has 2 divisors, whose sum is σ = 10607321048. Its totient is φ = 10607321046.

The previous prime is 10607321041. The next prime is 10607321069. The reversal of 10607321047 is 74012370601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10607321047 - 211 = 10607318999 is a prime.

It is a super-2 number, since 2×106073210472 (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 (10607321041) 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, 5303660523 + 5303660524.

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

Almost surely, 210607321047 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 7056, while the sum is 31.

Adding to 10607321047 its reverse (74012370601), we get a palindrome (84619691648).

The spelling of 10607321047 in words is "ten billion, six hundred seven million, three hundred twenty-one thousand, forty-seven".