Search a number
-
+
10525037401 is a prime number
BaseRepresentation
bin10011100110101011…
…10101001101011001
31000011111201022001001
421303111311031121
5133023402144101
64500220025001
7521551225144
oct116325651531
930144638031
1010525037401
11451112241a
122058992161
13cb96ca7a8
1471bb9505b
1541901e901
hex273575359

10525037401 has 2 divisors, whose sum is σ = 10525037402. Its totient is φ = 10525037400.

The previous prime is 10525037339. The next prime is 10525037431. The reversal of 10525037401 is 10473052501.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8514860176 + 2010177225 = 92276^2 + 44835^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10525037401 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 10525037401.

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

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

Almost surely, 210525037401 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4200, while the sum is 28.

Adding to 10525037401 its reverse (10473052501), we get a palindrome (20998089902).

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