Search a number
-
+
1055243314997 is a prime number
BaseRepresentation
bin11110101101100010110…
…01110010011100110101
310201212202201110121002122
433112301121302130311
5114242114242034442
62124434434245325
7136144625116304
oct17266131623465
93655681417078
101055243314997
11377587383123
1215061aa26845
1378680408b01
143910729443b
151c6b15c5dd2
hexf5b1672735

1055243314997 has 2 divisors, whose sum is σ = 1055243314998. Its totient is φ = 1055243314996.

The previous prime is 1055243314991. The next prime is 1055243315033. The reversal of 1055243314997 is 7994133425501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1040224567396 + 15018747601 = 1019914^2 + 122551^2 .

It is a cyclic number.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1055243314991) 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, 527621657498 + 527621657499.

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

Almost surely, 21055243314997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4082400, while the sum is 53.

The spelling of 1055243314997 in words is "one trillion, fifty-five billion, two hundred forty-three million, three hundred fourteen thousand, nine hundred ninety-seven".