Search a number
-
+
597855025153 is a prime number
BaseRepresentation
bin10001011001100101110…
…11111011100000000001
32010011011112201001011101
420230302323323200001
534243401341301103
61134352324014401
761123255603021
oct10546273734001
92104145631141
10597855025153
11210604637211
1297a50531401
13444ba453619
1420d1744ba81
15108418bea1d
hex8b32efb801

597855025153 has 2 divisors, whose sum is σ = 597855025154. Its totient is φ = 597855025152.

The previous prime is 597855025147. The next prime is 597855025213. The reversal of 597855025153 is 351520558795.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 508986645489 + 88868379664 = 713433^2 + 298108^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 2597855025153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9450000, while the sum is 55.

The spelling of 597855025153 in words is "five hundred ninety-seven billion, eight hundred fifty-five million, twenty-five thousand, one hundred fifty-three".