Search a number
-
+
104994665067 = 3259391349251
BaseRepresentation
bin110000111001000101…
…0110111001001101011
3101001000020222121122210
41201302022313021223
53210012113240232
6120122304020203
710404602633145
oct1416212671153
9331006877583
10104994665067
1140589829976
1218422601663
139b93520c66
145120533c95
152ae798a5cc
hex18722b726b

104994665067 has 8 divisors (see below), whose sum is σ = 139998387520. Its totient is φ = 69993693000.

The previous prime is 104994665003. The next prime is 104994665089. The reversal of 104994665067 is 760566499401.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 104994665067 - 26 = 104994665003 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 104994664998 and 104994665016.

It is not an unprimeable number, because it can be changed into a prime (104994615067) 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 in 7 ways as a sum of consecutive naturals, for example, 596809 + ... + 752442.

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

Almost surely, 2104994665067 is an apocalyptic number.

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

104994665067 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 1375193.

The product of its (nonzero) digits is 9797760, while the sum is 57.

The spelling of 104994665067 in words is "one hundred four billion, nine hundred ninety-four million, six hundred sixty-five thousand, sixty-seven".

Divisors: 1 3 25939 77817 1349251 4047753 34998221689 104994665067