Search a number
-
+
485192032667 is a prime number
BaseRepresentation
bin1110000111101111011…
…00101110000110011011
31201101100212102000211222
413003313230232012123
530422133130021132
61010521045042255
750024340142046
oct7036754560633
91641325360758
10485192032667
11177850287471
127a0499b638b
13369a4329724
14196aa709c5d
15c94ab02412
hex70f7b2e19b

485192032667 has 2 divisors, whose sum is σ = 485192032668. Its totient is φ = 485192032666.

The previous prime is 485192032627. The next prime is 485192032669. The reversal of 485192032667 is 766230291584.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 485192032667 - 26 = 485192032603 is a prime.

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

Together with 485192032669, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅485192032667 = 970384065334 is not.

Almost surely, 2485192032667 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4354560, while the sum is 53.

The spelling of 485192032667 in words is "four hundred eighty-five billion, one hundred ninety-two million, thirty-two thousand, six hundred sixty-seven".