Search a number
-
+
485408479993 is a prime number
BaseRepresentation
bin1110001000001001001…
…10011001101011111001
31201101220221200200202121
413010010212121223321
530423104032324433
61010554340201241
750032606000603
oct7040446315371
91641827620677
10485408479993
11177951483558
127a0aa399221
1336a0a122078
14196cb370173
15c95eb09c2d
hex7104999af9

485408479993 has 2 divisors, whose sum is σ = 485408479994. Its totient is φ = 485408479992.

The previous prime is 485408479961. The next prime is 485408480023. The reversal of 485408479993 is 399974804584.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 390908801529 + 94499678464 = 625227^2 + 307408^2 .

It is a cyclic number.

It is not a de Polignac number, because 485408479993 - 25 = 485408479961 is a prime.

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

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

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

Almost surely, 2485408479993 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 313528320, while the sum is 70.

The spelling of 485408479993 in words is "four hundred eighty-five billion, four hundred eight million, four hundred seventy-nine thousand, nine hundred ninety-three".