Search a number
-
+
1393052644597 is a prime number
BaseRepresentation
bin10100010001011000011…
…010000111010011110101
311221011201020022120111111
4110101120122013103311
5140310432434111342
62543543132435021
7202434100051405
oct24213032072365
94834636276444
101393052644597
114978769a0359
121a5b96618a71
13a14974a3ca3
144b5d1a74805
1526383294217
hex144586874f5

1393052644597 has 2 divisors, whose sum is σ = 1393052644598. Its totient is φ = 1393052644596.

The previous prime is 1393052644559. The next prime is 1393052644657. The reversal of 1393052644597 is 7954462503931.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 883733485041 + 509319159556 = 940071^2 + 713666^2 .

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

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

Almost surely, 21393052644597 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1393052644597 in words is "one trillion, three hundred ninety-three billion, fifty-two million, six hundred forty-four thousand, five hundred ninety-seven".