Search a number
-
+
485851562153 is a prime number
BaseRepresentation
bin1110001000111110000…
…00101000000010101001
31201110001211102121012222
413010133000220002221
530430010444442103
61011110325043425
750046566065406
oct7043700500251
91643054377188
10485851562153
111780595a4761
127a1b2856575
1336a7ab69069
141973014b2ad
15c98897d638
hex711f0280a9

485851562153 has 2 divisors, whose sum is σ = 485851562154. Its totient is φ = 485851562152.

The previous prime is 485851562117. The next prime is 485851562173. The reversal of 485851562153 is 351265158584.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 408273715369 + 77577846784 = 638963^2 + 278528^2 .

It is a cyclic number.

It is not a de Polignac number, because 485851562153 - 214 = 485851545769 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2485851562153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5760000, while the sum is 53.

The spelling of 485851562153 in words is "four hundred eighty-five billion, eight hundred fifty-one million, five hundred sixty-two thousand, one hundred fifty-three".