Search a number
-
+
11296501213 is a prime number
BaseRepresentation
bin10101000010101001…
…01110110111011101
31002011021100201102211
422201110232313131
5141113401014323
65104535120421
7546636450604
oct124124566735
932137321384
1011296501213
114877642618
122233213111
1310b049ba5a
14792412a3b
15461b0b70d
hex2a152eddd

11296501213 has 2 divisors, whose sum is σ = 11296501214. Its totient is φ = 11296501212.

The previous prime is 11296501193. The next prime is 11296501217. The reversal of 11296501213 is 31210569211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10198374169 + 1098127044 = 100987^2 + 33138^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11296501213 - 29 = 11296500701 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (11296501217) 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, 5648250606 + 5648250607.

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

Almost surely, 211296501213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 31.

The spelling of 11296501213 in words is "eleven billion, two hundred ninety-six million, five hundred one thousand, two hundred thirteen".