Search a number
-
+
483125231 is a prime number
BaseRepresentation
bin11100110010111…
…110011111101111
31020200002022020002
4130302332133233
51442140001411
6115535014515
714654332241
oct3462763757
91220068202
10483125231
11228791156
1211596a43b
1379127324
1448242091
152c63333b
hex1ccbe7ef

483125231 has 2 divisors, whose sum is σ = 483125232. Its totient is φ = 483125230.

The previous prime is 483125183. The next prime is 483125233. The reversal of 483125231 is 132521384.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 483125231 - 222 = 478930927 is a prime.

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

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

It is a Chen prime.

It is equal to p25512671 and since 483125231 and 25512671 have the same sum of digits, it is a Honaker prime.

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

It is a congruent number.

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

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

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

Almost surely, 2483125231 is an apocalyptic number.

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

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

483125231 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 483125231 is about 21980.1098950847. The cubic root of 483125231 is about 784.6691404595.

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