Search a number
-
+
10500497951 is a prime number
BaseRepresentation
bin10011100011110000…
…01110001000011111
31000002210112120020112
421301320032020133
5133001111413301
64453542040235
7521132521436
oct116170161037
930083476215
1010500497951
1144a9291589
12205071907b
13cb45b80c8
1471880811d
15416cc39bb
hex271e0e21f

10500497951 has 2 divisors, whose sum is σ = 10500497952. Its totient is φ = 10500497950.

The previous prime is 10500497941. The next prime is 10500497957. The reversal of 10500497951 is 15979400501.

10500497951 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 is a cyclic number.

It is not a de Polignac number, because 10500497951 - 214 = 10500481567 is a prime.

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

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 10500497899 and 10500497908.

It is a congruent number.

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

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

Almost surely, 210500497951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 56700, while the sum is 41.

The spelling of 10500497951 in words is "ten billion, five hundred million, four hundred ninety-seven thousand, nine hundred fifty-one".