Base | Representation |
---|---|
bin | 110000100111110010… |
… | …0001110010110001111 |
3 | 100222111210120102100201 |
4 | 1201033210032112033 |
5 | 3202320003023434 |
6 | 115544524434331 |
7 | 10354323205063 |
oct | 1411744162617 |
9 | 328453512321 |
10 | 104414111119 |
11 | 4031105311a |
12 | 182a00a89a7 |
13 | 9b00173606 |
14 | 50a73adaa3 |
15 | 2ab1a0e614 |
hex | 184f90e58f |
104414111119 has 4 divisors (see below), whose sum is σ = 104423061600. Its totient is φ = 104405160640.
The previous prime is 104414111083. The next prime is 104414111161. The reversal of 104414111119 is 911111414401.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 911111414401 = 1999 ⋅455783599.
It is a cyclic number.
It is not a de Polignac number, because 104414111119 - 227 = 104279893391 is a prime.
It is a super-2 number, since 2×1044141111192 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104414111819) 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, 4457719 + ... + 4481080.
It is an arithmetic number, because the mean of its divisors is an integer number (26105765400).
Almost surely, 2104414111119 is an apocalyptic number.
104414111119 is a deficient number, since it is larger than the sum of its proper divisors (8950481).
104414111119 is an equidigital number, since it uses as much as digits as its factorization.
104414111119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8950480.
The product of its (nonzero) digits is 576, while the sum is 28.
The spelling of 104414111119 in words is "one hundred four billion, four hundred fourteen million, one hundred eleven thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •