Base | Representation |
---|---|
bin | 110000101101101001… |
… | …1111101010101001111 |
3 | 101000000112101020102020 |
4 | 1201123103331111033 |
5 | 3203220430024321 |
6 | 120020244301223 |
7 | 10362235206432 |
oct | 1413323752517 |
9 | 330015336366 |
10 | 104611173711 |
11 | 4040230a170 |
12 | 183360a1813 |
13 | 9b31c3c8b5 |
14 | 50c5629819 |
15 | 2ac3e884c6 |
hex | 185b4fd54f |
104611173711 has 8 divisors (see below), whose sum is σ = 152161707264. Its totient is φ = 63400711320.
The previous prime is 104611173673. The next prime is 104611173727. The reversal of 104611173711 is 117371116401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 104611173711 - 26 = 104611173647 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (33), and also a Moran number because the ratio is a prime number: 3170035567 = 104611173711 / (1 + 0 + 4 + 6 + 1 + 1 + 1 + 7 + 3 + 7 + 1 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104611173311) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1585017751 + ... + 1585017816.
It is an arithmetic number, because the mean of its divisors is an integer number (19020213408).
Almost surely, 2104611173711 is an apocalyptic number.
104611173711 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
104611173711 is a deficient number, since it is larger than the sum of its proper divisors (47550533553).
104611173711 is a wasteful number, since it uses less digits than its factorization.
104611173711 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3170035581.
The product of its (nonzero) digits is 3528, while the sum is 33.
The spelling of 104611173711 in words is "one hundred four billion, six hundred eleven million, one hundred seventy-three thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •