Search a number
-
+
10435925713 is a prime number
BaseRepresentation
bin10011011100000011…
…11001011011010001
3222221022000221210011
421232001321123101
5132333044110323
64443314034521
7516416622253
oct115601713321
928838027704
1010435925713
1144758984a4
122032b78a41
13ca40c9c95
1470ddd9cd3
154112bb20d
hex26e0796d1

10435925713 has 2 divisors, whose sum is σ = 10435925714. Its totient is φ = 10435925712.

The previous prime is 10435925683. The next prime is 10435925743. The reversal of 10435925713 is 31752953401.

10435925713 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a balanced prime because it is at equal distance from previous prime (10435925683) and next prime (10435925743).

It can be written as a sum of positive squares in only one way, i.e., 7230441024 + 3205484689 = 85032^2 + 56617^2 .

It is a cyclic number.

It is not a de Polignac number, because 10435925713 - 25 = 10435925681 is a prime.

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

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

Almost surely, 210435925713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 113400, while the sum is 40.

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