Search a number
-
+
325433202301343 is a prime number
BaseRepresentation
bin100100111111110101101001…
…0011010111101100110011111
31120200021002222102002020220102
41021333223102122331212133
5320123344144242120333
63112045541011411315
7125355526062210413
oct11177532232754637
91520232872066812
10325433202301343
119476949a744884
12305bb174bb3b3b
1310c782b0a493a6
145a510a0070d43
1527953e763dae8
hex127fad26bd99f

325433202301343 has 2 divisors, whose sum is σ = 325433202301344. Its totient is φ = 325433202301342.

The previous prime is 325433202301309. The next prime is 325433202301369. The reversal of 325433202301343 is 343103202334523.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 325433202301343 - 28 = 325433202301087 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2325433202301343 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 466560, while the sum is 38.

Adding to 325433202301343 its reverse (343103202334523), we get a palindrome (668536404635866).

The spelling of 325433202301343 in words is "three hundred twenty-five trillion, four hundred thirty-three billion, two hundred two million, three hundred one thousand, three hundred forty-three".