Search a number
-
+
1078371536857 is a prime number
BaseRepresentation
bin11111011000100111111…
…00111100111111011001
310211002110120022000000021
433230103330330333121
5120132001103134412
62143221432310441
7140624023552456
oct17542374747731
93732416260007
101078371536857
1138637568a56a
12154bb4542421
137a8c7c102a4
143a29cbdc82d
151d0b6cb2607
hexfb13f3cfd9

1078371536857 has 2 divisors, whose sum is σ = 1078371536858. Its totient is φ = 1078371536856.

The previous prime is 1078371536833. The next prime is 1078371536873. The reversal of 1078371536857 is 7586351738701.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 637991977536 + 440379559321 = 798744^2 + 663611^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1078371536857 - 231 = 1076224053209 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1078371536795 and 1078371536804.

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

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

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

Almost surely, 21078371536857 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 29635200, while the sum is 61.

The spelling of 1078371536857 in words is "one trillion, seventy-eight billion, three hundred seventy-one million, five hundred thirty-six thousand, eight hundred fifty-seven".