Search a number
-
+
10501525031 is a prime number
BaseRepresentation
bin10011100011111000…
…01000111000100111
31000002212110202010112
421301330020320213
5133001342300111
64454020043235
7521144330024
oct116174107047
930085422115
1010501525031
1144a9923208
122050b3351b
13cb488774a
147189d454b
15416e27e8b
hex271f08e27

10501525031 has 2 divisors, whose sum is σ = 10501525032. Its totient is φ = 10501525030.

The previous prime is 10501525009. The next prime is 10501525049. The reversal of 10501525031 is 13052510501.

It is a happy number.

10501525031 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 a de Polignac number, because none of the positive numbers 2k-10501525031 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 210501525031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 750, while the sum is 23.

The spelling of 10501525031 in words is "ten billion, five hundred one million, five hundred twenty-five thousand, thirty-one".