Search a number
-
+
485232131 is a prime number
BaseRepresentation
bin11100111011000…
…000111000000011
31020211001100100102
4130323000320003
51443204412011
6120052113015
715011255636
oct3473007003
91224040312
10485232131
112299a009a
1211660576b
13796b4307
144862dc1d
152c8ec73b
hex1cec0e03

485232131 has 2 divisors, whose sum is σ = 485232132. Its totient is φ = 485232130.

The previous prime is 485232113. The next prime is 485232133. The reversal of 485232131 is 131232584.

It is a happy number.

Together with previous prime (485232113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 485232131 - 26 = 485232067 is a prime.

It is a super-2 number, since 2×4852321312 = 470900441909602322, which contains 22 as substring.

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

It is a Chen prime.

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

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

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

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

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

Almost surely, 2485232131 is an apocalyptic number.

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

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

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

The product of its digits is 5760, while the sum is 29.

The square root of 485232131 is about 22027.9851779503. The cubic root of 485232131 is about 785.8081287881.

The spelling of 485232131 in words is "four hundred eighty-five million, two hundred thirty-two thousand, one hundred thirty-one".