Search a number
-
+
11520504092651 is a prime number
BaseRepresentation
bin1010011110100101001110…
…0011011101011111101011
31111210100102201221012220212
42213221103203131133223
53002222443021431101
640300240240411335
72266220555030531
oct247512343353753
944710381835825
1011520504092651
113741900248724
121360901616b4b
136574c0505618
142bb8499c0151
1514ea1c42e1bb
hexa7a538dd7eb

11520504092651 has 2 divisors, whose sum is σ = 11520504092652. Its totient is φ = 11520504092650.

The previous prime is 11520504092639. The next prime is 11520504092653. The reversal of 11520504092651 is 15629040502511.

It is a happy number.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 11520504092651 - 238 = 11245626185707 is a prime.

Together with 11520504092653, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 211520504092651 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 108000, while the sum is 41.

The spelling of 11520504092651 in words is "eleven trillion, five hundred twenty billion, five hundred four million, ninety-two thousand, six hundred fifty-one".