Search a number
-
+
1133963216957 is a prime number
BaseRepresentation
bin10000100000000101011…
…110011000100000111101
311000101221211211221201002
4100200011132120200331
5122034324040420312
62224534023100045
7144632444210534
oct20400536304075
94011854757632
101133963216957
113a7a0274563a
12163929ba1625
1382c1728355c
143cc5400d31b
151e76c4d64c2
hex1080579883d

1133963216957 has 2 divisors, whose sum is σ = 1133963216958. Its totient is φ = 1133963216956.

The previous prime is 1133963216951. The next prime is 1133963216959. The reversal of 1133963216957 is 7596123693311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1103941070596 + 30022146361 = 1050686^2 + 173269^2 .

It is a cyclic number.

It is not a de Polignac number, because 1133963216957 - 212 = 1133963212861 is a prime.

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

Together with 1133963216959, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21133963216957 is an apocalyptic number.

It is an amenable number.

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

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

1133963216957 is an evil number, because the sum of its binary digits is even.

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

The spelling of 1133963216957 in words is "one trillion, one hundred thirty-three billion, nine hundred sixty-three million, two hundred sixteen thousand, nine hundred fifty-seven".