Search a number
-
+
483111131 is a prime number
BaseRepresentation
bin11100110010111…
…011000011011011
31020200001120212212
4130302323003123
51442134024011
6115534425335
714654243156
oct3462730333
91220046785
10483111131
112287815a8
1211596224b
1379120a99
144823ac9d
152c62e08b
hex1ccbb0db

483111131 has 2 divisors, whose sum is σ = 483111132. Its totient is φ = 483111130.

The previous prime is 483111091. The next prime is 483111133. The reversal of 483111131 is 131111384.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

It is a Sophie Germain prime.

Together with 483111133, 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 = 483111097 and 483111106.

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

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

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

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

Almost surely, 2483111131 is an apocalyptic number.

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

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

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

The product of its digits is 288, while the sum is 23.

The square root of 483111131 is about 21979.7891482152. The cubic root of 483111131 is about 784.6615068676.

The spelling of 483111131 in words is "four hundred eighty-three million, one hundred eleven thousand, one hundred thirty-one".