Search a number
-
+
8248187749 is a prime number
BaseRepresentation
bin1111010111010000…
…10101101101100101
3210021211102100111011
413223220111231211
5113343014001444
63442243142221
7411253303414
oct75350255545
923254370434
108248187749
11355298359a
121722374971
13a15a9c989
1458363147b
153341c2734
hex1eba15b65

8248187749 has 2 divisors, whose sum is σ = 8248187750. Its totient is φ = 8248187748.

The previous prime is 8248187713. The next prime is 8248187797. The reversal of 8248187749 is 9477818428.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7982171649 + 266016100 = 89343^2 + 16310^2 .

It is a cyclic number.

It is not a de Polignac number, because 8248187749 - 29 = 8248187237 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 28248187749 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 7225344, while the sum is 58.

The square root of 8248187749 is about 90819.5339615878. The cubic root of 8248187749 is about 2020.4720451072.

The spelling of 8248187749 in words is "eight billion, two hundred forty-eight million, one hundred eighty-seven thousand, seven hundred forty-nine".