Search a number
-
+
104730792613 is a prime number
BaseRepresentation
bin110000110001001110…
…0010001001010100101
3101000022212110111200221
41201202130101022211
53203442040330423
6120040200204341
710365220022536
oct1414234211245
9330285414627
10104730792613
1140463890667
121836a1696b1
139b50962205
1450d748668d
152ace715e5d
hex18627112a5

104730792613 has 2 divisors, whose sum is σ = 104730792614. Its totient is φ = 104730792612.

The previous prime is 104730792581. The next prime is 104730792667. The reversal of 104730792613 is 316297037401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 95872594689 + 8858197924 = 309633^2 + 94118^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 104730792613 - 25 = 104730792581 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2104730792613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 190512, while the sum is 43.

The spelling of 104730792613 in words is "one hundred four billion, seven hundred thirty million, seven hundred ninety-two thousand, six hundred thirteen".