Search a number
-
+
10635000433 is a prime number
BaseRepresentation
bin10011110011110010…
…10011101001110001
31000110011121222221221
421321321103221301
5133240030003213
64515144545041
7524355004111
oct117171235161
930404558857
1010635000433
1145681a9262
122089782181
13100641c085
1472c61b041
154239e138d
hex279e53a71

10635000433 has 2 divisors, whose sum is σ = 10635000434. Its totient is φ = 10635000432.

The previous prime is 10635000407. The next prime is 10635000451. The reversal of 10635000433 is 33400053601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10413794304 + 221206129 = 102048^2 + 14873^2 .

It is a cyclic number.

It is not a de Polignac number, because 10635000433 - 229 = 10098129521 is a prime.

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

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

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

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

Almost surely, 210635000433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 25.

The spelling of 10635000433 in words is "ten billion, six hundred thirty-five million, four hundred thirty-three", and thus it is an aban number.