Search a number
-
+
1102743377797 is a prime number
BaseRepresentation
bin10000000011000000101…
…000001001011110000101
310220102101002012210120211
4100003000220021132011
5121031404301042142
62202332053355421
7142446003024355
oct20030050113605
93812332183524
101102743377797
11395741985376
12159876638b71
137ccb026bb49
143b53198cb65
151da41753917
hex100c0a09785

1102743377797 has 2 divisors, whose sum is σ = 1102743377798. Its totient is φ = 1102743377796.

The previous prime is 1102743377779. The next prime is 1102743377843. The reversal of 1102743377797 is 7977733472011.

Together with previous prime (1102743377779) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 673500890241 + 429242487556 = 820671^2 + 655166^2 .

It is a cyclic number.

It is not a de Polignac number, because 1102743377797 - 223 = 1102734989189 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 21102743377797 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10890936, while the sum is 58.

The spelling of 1102743377797 in words is "one trillion, one hundred two billion, seven hundred forty-three million, three hundred seventy-seven thousand, seven hundred ninety-seven".