Search a number
-
+
104387563219 = 313367340749
BaseRepresentation
bin110000100110111111…
…0111100111011010011
3100222102221121122111011
41201031332330323103
53202241204010334
6115542135431351
710353551435002
oct1411576747323
9328387548434
10104387563219
11402a8070305
1218293225557
139ac78099b4
1450a3a5cc39
152aae518564
hex184dfbced3

104387563219 has 4 divisors (see below), whose sum is σ = 107754904000. Its totient is φ = 101020222440.

The previous prime is 104387563213. The next prime is 104387563223. The reversal of 104387563219 is 912365783401.

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 104387563219 - 23 = 104387563211 is a prime.

It is a super-2 number, since 2×1043875632192 (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 (104387563211) by changing a digit.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅104387563219 = 208775126438 is not.

Almost surely, 2104387563219 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3367340780.

The product of its (nonzero) digits is 1088640, while the sum is 49.

The spelling of 104387563219 in words is "one hundred four billion, three hundred eighty-seven million, five hundred sixty-three thousand, two hundred nineteen".

Divisors: 1 31 3367340749 104387563219