Search a number
-
+
325364551751 is a prime number
BaseRepresentation
bin1001011110000010011…
…11010001000001000111
31011002211012210202112202
410233001033101001013
520312321311124001
6405245335305115
732335560025661
oct4570117210107
91132735722482
10325364551751
11115a93897468
1253083b1b19b
13248b2a44905
1411a67aa3531
1586e439196b
hex4bc13d1047

325364551751 has 2 divisors, whose sum is σ = 325364551752. Its totient is φ = 325364551750.

The previous prime is 325364551741. The next prime is 325364551801. The reversal of 325364551751 is 157155463523.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 325364551751 - 222 = 325360357447 is a prime.

It is a super-3 number, since 3×3253645517513 (a number of 36 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a congruent number.

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

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

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

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

Almost surely, 2325364551751 is an apocalyptic number.

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

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

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

The product of its digits is 1890000, while the sum is 47.

The spelling of 325364551751 in words is "three hundred twenty-five billion, three hundred sixty-four million, five hundred fifty-one thousand, seven hundred fifty-one".