Search a number
-
+
104960978329 = 691151897219
BaseRepresentation
bin110000111000000101…
…0010110110110011001
3101000220220121011010211
41201300022112312121
53204430002301304
6120115102011121
710404013411114
oct1416012266631
9330826534124
10104960978329
1140571810599
1218413276aa1
139b89557b8c
145119c8557b
152ae4a34204
hex1870296d99

104960978329 has 4 divisors (see below), whose sum is σ = 105112876240. Its totient is φ = 104809080420.

The previous prime is 104960978321. The next prime is 104960978351. The reversal of 104960978329 is 923879069401.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 104960978329 - 23 = 104960978321 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (104960978321) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 75947919 + ... + 75949300.

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

Almost surely, 2104960978329 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 151897910.

The product of its (nonzero) digits is 5878656, while the sum is 58.

The spelling of 104960978329 in words is "one hundred four billion, nine hundred sixty million, nine hundred seventy-eight thousand, three hundred twenty-nine".

Divisors: 1 691 151897219 104960978329