Search a number
-
+
11300115269 is a prime number
BaseRepresentation
bin10101000011000101…
…00001001101000101
31002011112011022222202
422201202201031011
5141120312142034
65105144404245
7550012252322
oct124142411505
932145138882
1011300115269
114879690943
122234476685
1310b1165a51
14792ab3b49
154620c247e
hex2a18a1345

11300115269 has 2 divisors, whose sum is σ = 11300115270. Its totient is φ = 11300115268.

The previous prime is 11300115259. The next prime is 11300115289. The reversal of 11300115269 is 96251100311.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 5899776100 + 5400339169 = 76810^2 + 73487^2 .

It is a cyclic number.

It is not a de Polignac number, because 11300115269 - 220 = 11299066693 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 211300115269 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11300115269 in words is "eleven billion, three hundred million, one hundred fifteen thousand, two hundred sixty-nine".