Search a number
-
+
4765650270529 is a prime number
BaseRepresentation
bin100010101011001011011…
…1001000011100101000001
3121212120222100202101110011
41011112112321003211001
51111040022432124104
614045150504304521
71001210153633221
oct105262671034501
917776870671404
104765650270529
111578112379195
1264b746772141
1328752549b5a5
141269316aa081
1583e73869904
hex45596e43941

4765650270529 has 2 divisors, whose sum is σ = 4765650270530. Its totient is φ = 4765650270528.

The previous prime is 4765650270449. The next prime is 4765650270547. The reversal of 4765650270529 is 9250720565674.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4236401295504 + 529248975025 = 2058252^2 + 727495^2 .

It is a cyclic number.

It is not a de Polignac number, because 4765650270529 - 27 = 4765650270401 is a prime.

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

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

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

Almost surely, 24765650270529 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 4765650270529 in words is "four trillion, seven hundred sixty-five billion, six hundred fifty million, two hundred seventy thousand, five hundred twenty-nine".