Search a number
-
+
1311056530369 is a prime number
BaseRepresentation
bin10011000101000001000…
…011110000101111000001
311122100001210011101112221
4103011001003300233001
5132440020432432434
62442142511251041
7163502126430655
oct23050103605701
94570053141487
101311056530369
1146601a2610a3
12192112219a81
139682a9556c1
1447653b72a65
152418492e2b4
hex131410f0bc1

1311056530369 has 2 divisors, whose sum is σ = 1311056530370. Its totient is φ = 1311056530368.

The previous prime is 1311056530363. The next prime is 1311056530411. The reversal of 1311056530369 is 9630356501131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1176302930625 + 134753599744 = 1084575^2 + 367088^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1311056530369 - 29 = 1311056529857 is a prime.

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

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

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

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

Almost surely, 21311056530369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 218700, while the sum is 43.

The spelling of 1311056530369 in words is "one trillion, three hundred eleven billion, fifty-six million, five hundred thirty thousand, three hundred sixty-nine".