Search a number
-
+
48986511361 is a prime number
BaseRepresentation
bin101101100111110100…
…101101100000000001
311200102221202121120121
4231213310231200001
51300311021330421
634300514540241
73352634322244
oct554764554001
9150387677517
1048986511361
1119858677037
1295b1597681
134808abc0c8
142529cb125b
15141a8ebd41
hexb67d2d801

48986511361 has 2 divisors, whose sum is σ = 48986511362. Its totient is φ = 48986511360.

The previous prime is 48986511323. The next prime is 48986511391. The reversal of 48986511361 is 16311568984.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 47227547761 + 1758963600 = 217319^2 + 41940^2 .

It is a cyclic number.

It is not a de Polignac number, because 48986511361 - 225 = 48952956929 is a prime.

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

It is not a weakly prime, because it can be changed into another prime (48986511391) 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, 24493255680 + 24493255681.

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

Almost surely, 248986511361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1244160, while the sum is 52.

The spelling of 48986511361 in words is "forty-eight billion, nine hundred eighty-six million, five hundred eleven thousand, three hundred sixty-one".