Search a number
-
+
104903115773 is a prime number
BaseRepresentation
bin110000110110010110…
…1101000001111111101
3101000202212201102122012
41201230231220033331
53204320144201043
6120105233501005
710402411525451
oct1415455501775
9330685642565
10104903115773
114054208a5a5
12183b7a11765
139b7a578a91
145112302661
152ade904a18
hex186cb683fd

104903115773 has 2 divisors, whose sum is σ = 104903115774. Its totient is φ = 104903115772.

The previous prime is 104903115769. The next prime is 104903115781. The reversal of 104903115773 is 377511309401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 102478735129 + 2424380644 = 320123^2 + 49238^2 .

It is a cyclic number.

It is not a de Polignac number, because 104903115773 - 22 = 104903115769 is a prime.

It is a super-3 number, since 3×1049031157733 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

It is a congruent number.

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

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

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

Almost surely, 2104903115773 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 79380, while the sum is 41.

The spelling of 104903115773 in words is "one hundred four billion, nine hundred three million, one hundred fifteen thousand, seven hundred seventy-three".