Base | Representation |
---|---|
bin | 110000011111101101… |
… | …0000011110101100001 |
3 | 100221210220110010010211 |
4 | 1200333122003311201 |
5 | 3201241102324134 |
6 | 115502002054121 |
7 | 10344521663161 |
oct | 1407732036541 |
9 | 327726403124 |
10 | 104143011169 |
11 | 4019201877a |
12 | 1822534a341 |
13 | 9a88c53c42 |
14 | 507d3a05a1 |
15 | 2a97d0d764 |
hex | 183f683d61 |
104143011169 has 2 divisors, whose sum is σ = 104143011170. Its totient is φ = 104143011168.
The previous prime is 104143011053. The next prime is 104143011191. The reversal of 104143011169 is 961110341401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70466357025 + 33676654144 = 265455^2 + 183512^2 .
It is a cyclic number.
It is not a de Polignac number, because 104143011169 - 217 = 104142880097 is a prime.
It is a super-2 number, since 2×1041430111692 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 104143011169.
It is not a weakly prime, because it can be changed into another prime (104143011769) 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 as a sum of consecutive naturals, namely, 52071505584 + 52071505585.
It is an arithmetic number, because the mean of its divisors is an integer number (52071505585).
Almost surely, 2104143011169 is an apocalyptic number.
It is an amenable number.
104143011169 is a deficient number, since it is larger than the sum of its proper divisors (1).
104143011169 is an equidigital number, since it uses as much as digits as its factorization.
104143011169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 31.
The spelling of 104143011169 in words is "one hundred four billion, one hundred forty-three million, eleven thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •