Search a number
-
+
48710131 is a prime number
BaseRepresentation
bin1011100111010…
…0000111110011
310101122201201221
42321310013303
544432211011
64500005511
71131013021
oct271640763
9111581657
1048710131
112554a708
1214390897
13a126282
14667d711
154422971
hex2e741f3

48710131 has 2 divisors, whose sum is σ = 48710132. Its totient is φ = 48710130.

The previous prime is 48710089. The next prime is 48710141. The reversal of 48710131 is 13101784.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 48710131 - 27 = 48710003 is a prime.

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

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

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

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

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

Almost surely, 248710131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 672, while the sum is 25.

The square root of 48710131 is about 6979.2643595153. The cubic root of 48710131 is about 365.2075656836.

It can be divided in two parts, 48710 and 131, that added together give a square (48841 = 2212).

The spelling of 48710131 in words is "forty-eight million, seven hundred ten thousand, one hundred thirty-one".