Base | Representation |
---|---|
bin | 110000100101100111… |
… | …0010000010011101101 |
3 | 100222022201110100020211 |
4 | 1201023032100103231 |
5 | 3202142324234432 |
6 | 115533402542421 |
7 | 10352446634656 |
oct | 1411316202355 |
9 | 328281410224 |
10 | 104341243117 |
11 | 40283a03331 |
12 | 1827b807a11 |
13 | 9abb03c557 |
14 | 509b84252d |
15 | 2aaa418d47 |
hex | 184b3904ed |
104341243117 has 2 divisors, whose sum is σ = 104341243118. Its totient is φ = 104341243116.
The previous prime is 104341243093. The next prime is 104341243141. The reversal of 104341243117 is 711342143401.
It is a balanced prime because it is at equal distance from previous prime (104341243093) and next prime (104341243141).
It can be written as a sum of positive squares in only one way, i.e., 96863490441 + 7477752676 = 311229^2 + 86474^2 .
It is a cyclic number.
It is not a de Polignac number, because 104341243117 - 227 = 104207025389 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (107341243117) 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 as a sum of consecutive naturals, namely, 52170621558 + 52170621559.
It is an arithmetic number, because the mean of its divisors is an integer number (52170621559).
Almost surely, 2104341243117 is an apocalyptic number.
It is an amenable number.
104341243117 is a deficient number, since it is larger than the sum of its proper divisors (1).
104341243117 is an equidigital number, since it uses as much as digits as its factorization.
104341243117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 31.
Adding to 104341243117 its reverse (711342143401), we get a palindrome (815683386518).
The spelling of 104341243117 in words is "one hundred four billion, three hundred forty-one million, two hundred forty-three thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •