Search a number
-
+
104072047661 is a prime number
BaseRepresentation
bin110000011101100101…
…1010110110000101101
3100221121221220210111202
41200323023112300231
53201114421011121
6115450545055245
710343000544401
oct1407313266055
9327557823452
10104072047661
1140155a5984a
1218205627525
139a773389ba
145073bab101
152a9199240b
hex183b2d6c2d

104072047661 has 2 divisors, whose sum is σ = 104072047662. Its totient is φ = 104072047660.

The previous prime is 104072047657. The next prime is 104072047711. The reversal of 104072047661 is 166740270401.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96469254025 + 7602793636 = 310595^2 + 87194^2 .

It is a cyclic number.

It is not a de Polignac number, because 104072047661 - 22 = 104072047657 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2104072047661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56448, while the sum is 38.

The spelling of 104072047661 in words is "one hundred four billion, seventy-two million, forty-seven thousand, six hundred sixty-one".