Search a number
-
+
47865856057 is a prime number
BaseRepresentation
bin101100100101000001…
…110000000000111001
311120112212001102111121
4230211001300000321
51241012124343212
633553403225241
73313106030515
oct544501600071
9146485042447
1047865856057
1119333034128
12933a218221
13468a888966
142461117145
1513a2335d07
hexb25070039

47865856057 has 2 divisors, whose sum is σ = 47865856058. Its totient is φ = 47865856056.

The previous prime is 47865856037. The next prime is 47865856091. The reversal of 47865856057 is 75065856874.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 47411143081 + 454712976 = 217741^2 + 21324^2 .

It is a cyclic number.

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

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

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

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

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

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

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

Almost surely, 247865856057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56448000, while the sum is 61.

The spelling of 47865856057 in words is "forty-seven billion, eight hundred sixty-five million, eight hundred fifty-six thousand, fifty-seven".