Base | Representation |
---|---|
bin | 110000101110100101… |
… | …1111000010010100001 |
3 | 101000002201112101100201 |
4 | 1201131023320102201 |
5 | 3203302002012322 |
6 | 120023330145201 |
7 | 10363066340416 |
oct | 1413513702241 |
9 | 330081471321 |
10 | 104642610337 |
11 | 40419030a51 |
12 | 18344722201 |
13 | 9b385c8755 |
14 | 50c989010d |
15 | 2ac6ae7d27 |
hex | 185d2f84a1 |
104642610337 has 8 divisors (see below), whose sum is σ = 105232025600. Its totient is φ = 104053831200.
The previous prime is 104642610329. The next prime is 104642610341. The reversal of 104642610337 is 733016246401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 104642610337 - 23 = 104642610329 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104642610296 and 104642610305.
It is not an unprimeable number, because it can be changed into a prime (104642610377) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 172837 + ... + 489037.
It is an arithmetic number, because the mean of its divisors is an integer number (13154003200).
Almost surely, 2104642610337 is an apocalyptic number.
It is an amenable number.
104642610337 is a deficient number, since it is larger than the sum of its proper divisors (589415263).
104642610337 is a wasteful number, since it uses less digits than its factorization.
104642610337 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318063.
The product of its (nonzero) digits is 72576, while the sum is 37.
Adding to 104642610337 its reverse (733016246401), we get a palindrome (837658856738).
The spelling of 104642610337 in words is "one hundred four billion, six hundred forty-two million, six hundred ten thousand, three hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •