Search a number
-
+
11520504125461 is a prime number
BaseRepresentation
bin1010011110100101001110…
…0011100101100000010101
31111210100102201222212221001
42213221103203211200111
53002222443024003321
640300240241223301
72266220555225302
oct247512343454025
944710381885831
1011520504125461
113741900270341
121360901631b31
136574c0517536
142bb8499cc0a9
1514ea1c438c91
hexa7a538e5815

11520504125461 has 2 divisors, whose sum is σ = 11520504125462. Its totient is φ = 11520504125460.

The previous prime is 11520504125419. The next prime is 11520504125483. The reversal of 11520504125461 is 16452140502511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10809096222961 + 711407902500 = 3287719^2 + 843450^2 .

It is a cyclic number.

It is not a de Polignac number, because 11520504125461 - 29 = 11520504124949 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 11520504125461.

It is a congruent number.

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

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

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

Almost surely, 211520504125461 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48000, while the sum is 37.

Adding to 11520504125461 its reverse (16452140502511), we get a palindrome (27972644627972).

The spelling of 11520504125461 in words is "eleven trillion, five hundred twenty billion, five hundred four million, one hundred twenty-five thousand, four hundred sixty-one".