Search a number
-
+
11246136632669 is a prime number
BaseRepresentation
bin1010001110100111000111…
…1110101010010101011101
31110211010020121011010202202
42203221301332222111131
52433224041434221134
635530223121501245
72240335515063431
oct243516176522535
943733217133682
1011246136632669
113646506a410a4
1213176b04a1825
13637676c8cc73
142ac45cc3c9c1
1514781023bd7e
hexa3a71faa55d

11246136632669 has 2 divisors, whose sum is σ = 11246136632670. Its totient is φ = 11246136632668.

The previous prime is 11246136632573. The next prime is 11246136632683. The reversal of 11246136632669 is 96623663164211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9827203016569 + 1418933616100 = 3134837^2 + 1191190^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11246136632669 is a prime.

It is a super-2 number, since 2×112461366326692 (a number of 27 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 (11246136632699) by changing a digit.

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

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

Almost surely, 211246136632669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 10077696, while the sum is 56.

The spelling of 11246136632669 in words is "eleven trillion, two hundred forty-six billion, one hundred thirty-six million, six hundred thirty-two thousand, six hundred sixty-nine".