Search a number
-
+
355325899469 is a prime number
BaseRepresentation
bin1010010101110110001…
…00101111001011001101
31020222011021100220221212
411022323010233023031
521310201412240334
6431122351104205
734446210211652
oct5127304571315
91228137326855
10355325899469
11127769230462
1258a45b12065
13276790c5728
14132aad29c29
1593998d2ece
hex52bb12f2cd

355325899469 has 2 divisors, whose sum is σ = 355325899470. Its totient is φ = 355325899468.

The previous prime is 355325899463. The next prime is 355325899561. The reversal of 355325899469 is 964998523553.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 229236991369 + 126088908100 = 478787^2 + 355090^2 .

It is a cyclic number.

It is not a de Polignac number, because 355325899469 - 28 = 355325899213 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2355325899469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 314928000, while the sum is 68.

The spelling of 355325899469 in words is "three hundred fifty-five billion, three hundred twenty-five million, eight hundred ninety-nine thousand, four hundred sixty-nine".