Search a number
-
+
48783711209 is a prime number
BaseRepresentation
bin101101011011101111…
…000101101111101001
311122220211011022001212
4231123233011233221
51244402112224314
634224432122505
73344622463202
oct553357055751
9148824138055
1048783711209
1119764151302
129555696435
1347a5a9440c
14250ada05a9
151407bdce3e
hexb5bbc5be9

48783711209 has 2 divisors, whose sum is σ = 48783711210. Its totient is φ = 48783711208.

The previous prime is 48783711203. The next prime is 48783711211. The reversal of 48783711209 is 90211738784.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 48765005584 + 18705625 = 220828^2 + 4325^2 .

It is a cyclic number.

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

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

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

It is a Chen prime.

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

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

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

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

Almost surely, 248783711209 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 677376, while the sum is 50.

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