Search a number
-
+
489548769071 is a prime number
BaseRepresentation
bin1110001111110110110…
…00010110011100101111
31201210121111101011122112
413013323120112130233
531010043441102241
61012521241034235
750240321610335
oct7077330263457
91653544334575
10489548769071
11179686576a6a
127aa64a8597b
1337219b2256b
14199a11a1b55
15cb033421eb
hex71fb61672f

489548769071 has 2 divisors, whose sum is σ = 489548769072. Its totient is φ = 489548769070.

The previous prime is 489548769067. The next prime is 489548769107. The reversal of 489548769071 is 170967845984.

Together with next prime (489548769107) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 489548769071 - 22 = 489548769067 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2489548769071 is an apocalyptic number.

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

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

489548769071 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 121927680, while the sum is 68.

The spelling of 489548769071 in words is "four hundred eighty-nine billion, five hundred forty-eight million, seven hundred sixty-nine thousand, seventy-one".