Base | Representation |
---|---|
bin | 110000110100010111… |
… | …1111111110110010011 |
3 | 101000121020121111100212 |
4 | 1201220233333312103 |
5 | 3204201134042414 |
6 | 120054500434335 |
7 | 10400643430235 |
oct | 1415057776623 |
9 | 330536544325 |
10 | 104836627859 |
11 | 405085a8207 |
12 | 183996a89ab |
13 | 9b69869a12 |
14 | 5107556255 |
15 | 2ad8b6e83e |
hex | 1868bffd93 |
104836627859 has 8 divisors (see below), whose sum is σ = 107830524912. Its totient is φ = 101867996160.
The previous prime is 104836627849. The next prime is 104836627919. The reversal of 104836627859 is 958726638401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-104836627859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104836627798 and 104836627807.
It is not an unprimeable number, because it can be changed into a prime (104836627849) 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 7 ways as a sum of consecutive naturals, for example, 6307922 + ... + 6324519.
It is an arithmetic number, because the mean of its divisors is an integer number (13478815614).
It is a 1-persistent number, because it is pandigital, but 2⋅104836627859 = 209673255718 is not.
Almost surely, 2104836627859 is an apocalyptic number.
104836627859 is a deficient number, since it is larger than the sum of its proper divisors (2993897053).
104836627859 is a wasteful number, since it uses less digits than its factorization.
104836627859 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12632677.
The product of its (nonzero) digits is 17418240, while the sum is 59.
The spelling of 104836627859 in words is "one hundred four billion, eight hundred thirty-six million, six hundred twenty-seven thousand, eight hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •