Search a number
-
+
1143522113369 is a prime number
BaseRepresentation
bin10000101000111111001…
…110101011011101011001
311001022122000121012110112
4100220333032223131121
5122213413130111434
62233154331254105
7145421354405306
oct20507716533531
94038560535415
101143522113369
11400a6846aa29
121657572aa335
1383aab76a48c
143d4bd74c0ad
151eb2b7b1dce
hex10a3f3ab759

1143522113369 has 2 divisors, whose sum is σ = 1143522113370. Its totient is φ = 1143522113368.

The previous prime is 1143522113359. The next prime is 1143522113533. The reversal of 1143522113369 is 9633112253411.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1097130553600 + 46391559769 = 1047440^2 + 215387^2 .

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

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 21143522113369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 116640, while the sum is 41.

The spelling of 1143522113369 in words is "one trillion, one hundred forty-three billion, five hundred twenty-two million, one hundred thirteen thousand, three hundred sixty-nine".