Search a number
-
+
104636521051 = 505120716001
BaseRepresentation
bin110000101110011010…
…0101001101001011011
3101000002022002000102121
41201130310221221123
53203243422133201
6120022551442111
710362663516406
oct1413464515133
9330068060377
10104636521051
1140415651a87
1218342686337
139b37275c1a
1450c8b46d3d
152ac62e39a1
hex185cd29a5b

104636521051 has 4 divisors (see below), whose sum is σ = 104657242104. Its totient is φ = 104615800000.

The previous prime is 104636521027. The next prime is 104636521079. The reversal of 104636521051 is 150125636401.

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 104636521051 - 25 = 104636521019 is a prime.

It is a super-2 number, since 2×1046365210512 (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 = 104636520998 and 104636521016.

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

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

Almost surely, 2104636521051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 20721052.

The product of its (nonzero) digits is 21600, while the sum is 34.

The spelling of 104636521051 in words is "one hundred four billion, six hundred thirty-six million, five hundred twenty-one thousand, fifty-one".

Divisors: 1 5051 20716001 104636521051