Base | Representation |
---|---|
bin | 110000110101011001… |
… | …1010110110001110001 |
3 | 101000200122101222000011 |
4 | 1201222303112301301 |
5 | 3204233443001031 |
6 | 120102130454521 |
7 | 10401542216212 |
oct | 1415263266161 |
9 | 330618358004 |
10 | 104871062641 |
11 | 40525a87604 |
12 | 183a9134441 |
13 | 9b73a35427 |
14 | 510bd5b409 |
15 | 2adbbc26b1 |
hex | 186acd6c71 |
104871062641 has 4 divisors (see below), whose sum is σ = 104941305972. Its totient is φ = 104800819312.
The previous prime is 104871062599. The next prime is 104871062687. The reversal of 104871062641 is 146260178401.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 101312343616 + 3558719025 = 318296^2 + 59655^2 .
It is a cyclic number.
It is not a de Polignac number, because 104871062641 - 233 = 96281128049 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 104871062594 and 104871062603.
It is not an unprimeable number, because it can be changed into a prime (104871062441) 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, 35119426 + ... + 35122411.
It is an arithmetic number, because the mean of its divisors is an integer number (26235326493).
Almost surely, 2104871062641 is an apocalyptic number.
It is an amenable number.
104871062641 is a deficient number, since it is larger than the sum of its proper divisors (70243331).
104871062641 is an equidigital number, since it uses as much as digits as its factorization.
104871062641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70243330.
The product of its (nonzero) digits is 64512, while the sum is 40.
The spelling of 104871062641 in words is "one hundred four billion, eight hundred seventy-one million, sixty-two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •