Search a number
-
+
11635236433 is a prime number
BaseRepresentation
bin10101101011000001…
…11001111001010001
31010000212202020210201
422311200321321101
5142312110031213
65202315255201
7561221610052
oct126540717121
933025666721
1011635236433
114a30873387
12230874a501
13113570c7b2
147c53ca729
1548171c6dd
hex2b5839e51

11635236433 has 2 divisors, whose sum is σ = 11635236434. Its totient is φ = 11635236432.

The previous prime is 11635236391. The next prime is 11635236449. The reversal of 11635236433 is 33463253611.

11635236433 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 can be written as a sum of positive squares in only one way, i.e., 11348001729 + 287234704 = 106527^2 + 16948^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 211635236433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 116640, while the sum is 37.

The spelling of 11635236433 in words is "eleven billion, six hundred thirty-five million, two hundred thirty-six thousand, four hundred thirty-three".