Search a number
-
+
4852533322393 is a prime number
BaseRepresentation
bin100011010011101000110…
…0001100110001010011001
3122011220020101112201112221
41012213101201212022121
51114000442012304033
614153120101504041
71010404204453351
oct106472141461231
918156211481487
104852533322393
111600a47611a89
12664553712021
13292790610553
1412ac1463bb61
158635b25112d
hex469d1866299

4852533322393 has 2 divisors, whose sum is σ = 4852533322394. Its totient is φ = 4852533322392.

The previous prime is 4852533322381. The next prime is 4852533322397. The reversal of 4852533322393 is 3932233352584.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2587712997769 + 2264820324624 = 1608637^2 + 1504932^2 .

It is a cyclic number.

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

It is a self number, because there is not a number n which added to its sum of digits gives 4852533322393.

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

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

Almost surely, 24852533322393 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 13996800, while the sum is 52.

The spelling of 4852533322393 in words is "four trillion, eight hundred fifty-two billion, five hundred thirty-three million, three hundred twenty-two thousand, three hundred ninety-three".