Search a number
-
+
104791751 is a prime number
BaseRepresentation
bin1100011111011…
…11111011000111
321022011222020222
412033233323013
5203311314001
614222014555
72411500211
oct617577307
9238158228
10104791751
1154174659
122b11745b
131893086c
14dcbb5b1
1592ee61b
hex63efec7

104791751 has 2 divisors, whose sum is σ = 104791752. Its totient is φ = 104791750.

The previous prime is 104791727. The next prime is 104791769. The reversal of 104791751 is 157197401.

It is a strong prime.

It is an emirp because it is prime and its reverse (157197401) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 104791751 - 210 = 104790727 is a prime.

It is a super-2 number, since 2×1047917512 = 21962622155292002, which contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 2104791751 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8820, while the sum is 35.

The square root of 104791751 is about 10236.7842118509. The cubic root of 104791751 is about 471.4573011176.

The spelling of 104791751 in words is "one hundred four million, seven hundred ninety-one thousand, seven hundred fifty-one".