Search a number
-
+
104677011696219 = 334892337232073
BaseRepresentation
bin10111110011010000000100…
…000110010010101001011011
3111201122000122220221210120020
4113303100010012102221123
5102210012004443234334
61010343542203001523
731022443634465154
oct2763200406225133
9451560586853506
10104677011696219
11303982a91a6576
12b8a71335092a3
134653ccc8860a1
141bbc57433092b
15c17d51582e49
hex5f3404192a5b

104677011696219 has 4 divisors (see below), whose sum is σ = 139569348928296. Its totient is φ = 69784674464144.

The previous prime is 104677011696157. The next prime is 104677011696241. The reversal of 104677011696219 is 912696110776401.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 104677011696219 - 27 = 104677011696091 is a prime.

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

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

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

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

Almost surely, 2104677011696219 is an apocalyptic number.

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

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

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

The sum of its prime factors is 34892337232076.

The product of its (nonzero) digits is 6858432, while the sum is 60.

The spelling of 104677011696219 in words is "one hundred four trillion, six hundred seventy-seven billion, eleven million, six hundred ninety-six thousand, two hundred nineteen".

Divisors: 1 3 34892337232073 104677011696219