Search a number
-
+
11515010130227 is a prime number
BaseRepresentation
bin1010011110010000110000…
…0101101010000100110011
31111202211020212002000022002
42213210030011222010303
53002130220043131402
640253531142004215
72265634454103422
oct247441405520463
944684225060262
1011515010130227
11373a54102840a
12135b82971666b
13656b26226a96
142bb4880992b9
1514e7e9e53602
hexa790c16a133

11515010130227 has 2 divisors, whose sum is σ = 11515010130228. Its totient is φ = 11515010130226.

The previous prime is 11515010130047. The next prime is 11515010130287. The reversal of 11515010130227 is 72203101051511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11515010130227 - 28 = 11515010129971 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 211515010130227 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2100, while the sum is 29.

Adding to 11515010130227 its reverse (72203101051511), we get a palindrome (83718111181738).

The spelling of 11515010130227 in words is "eleven trillion, five hundred fifteen billion, ten million, one hundred thirty thousand, two hundred twenty-seven".