Search a number
-
+
104947587671 is a prime number
BaseRepresentation
bin110000110111101011…
…1010001101001010111
3101000212222101211121112
41201233113101221113
53204413040301141
6120113503005235
710403461530233
oct1415727215127
9330788354545
10104947587671
11405651a4a33
121840a89981b
139b86849c04
14511819b5c3
152ae378b7eb
hex186f5d1a57

104947587671 has 2 divisors, whose sum is σ = 104947587672. Its totient is φ = 104947587670.

The previous prime is 104947587607. The next prime is 104947587673. The reversal of 104947587671 is 176785749401.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 104947587671 - 26 = 104947587607 is a prime.

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

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

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 104947587671.

It is a congruent number.

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

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

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

Almost surely, 2104947587671 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 11854080, while the sum is 59.

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