Search a number
-
+
11638479532769 is a prime number
BaseRepresentation
bin1010100101011100101101…
…1100000011001011100001
31112012121221122112112100222
42221113023130003023201
53011141101230022034
640430351011452425
72310565241521145
oct251271334031341
945177848475328
1011638479532769
113787940310a61
12137b7472b7115
1366567212685b
142c343c0b7225
15152b247c012e
hexa95cb7032e1

11638479532769 has 2 divisors, whose sum is σ = 11638479532770. Its totient is φ = 11638479532768.

The previous prime is 11638479532733. The next prime is 11638479532787. The reversal of 11638479532769 is 96723597483611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8151670242769 + 3486809290000 = 2855113^2 + 1867300^2 .

It is a cyclic number.

It is not a de Polignac number, because 11638479532769 - 212 = 11638479528673 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is not a weakly prime, because it can be changed into another prime (11638479532709) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5819239766384 + 5819239766385.

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

Almost surely, 211638479532769 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 411505920, while the sum is 71.

The spelling of 11638479532769 in words is "eleven trillion, six hundred thirty-eight billion, four hundred seventy-nine million, five hundred thirty-two thousand, seven hundred sixty-nine".