Search a number
-
+
11540639948549 is a prime number
BaseRepresentation
bin1010011111110000001110…
…1111101001111100000101
31111212021102001002200102112
42213330003233221330011
53003040212311323144
640313410301550405
72300532550005005
oct247740357517405
944767361080375
1011540639948549
11374a3a3429248
1213647a0b75405
1365937c09925a
142bc7d9d4c005
151502ea08399e
hexa7f03be9f05

11540639948549 has 2 divisors, whose sum is σ = 11540639948550. Its totient is φ = 11540639948548.

The previous prime is 11540639948543. The next prime is 11540639948557. The reversal of 11540639948549 is 94584993604511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10385859744100 + 1154780204449 = 3222710^2 + 1074607^2 .

It is an emirp because it is prime and its reverse (94584993604511) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 11540639948549 - 228 = 11540371513093 is a prime.

It is a congruent number.

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

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

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

Almost surely, 211540639948549 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 167961600, while the sum is 68.

The spelling of 11540639948549 in words is "eleven trillion, five hundred forty billion, six hundred thirty-nine million, nine hundred forty-eight thousand, five hundred forty-nine".