Base | Representation |
---|---|
bin | 10111101111110110001111… |
… | …001010100010011000101011 |
3 | 111200210122221201112221010121 |
4 | 113233312033022202120223 |
5 | 102142144003120003003 |
6 | 1010044301355224111 |
7 | 30666523630020355 |
oct | 2757661712423053 |
9 | 450718851487117 |
10 | 104443121641003 |
11 | 30308096381282 |
12 | b86993a148037 |
13 | 4637c37296602 |
14 | 1bb11073100d5 |
15 | c11c12c2acbd |
hex | 5efd8f2a262b |
104443121641003 has 2 divisors, whose sum is σ = 104443121641004. Its totient is φ = 104443121641002.
The previous prime is 104443121640943. The next prime is 104443121641039. The reversal of 104443121641003 is 300146121344401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 104443121641003 - 217 = 104443121509931 is a prime.
It is a super-2 number, since 2×1044431216410032 (a number of 29 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 104443121641003.
It is not a weakly prime, because it can be changed into another prime (104443121641403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52221560820501 + 52221560820502.
It is an arithmetic number, because the mean of its divisors is an integer number (52221560820502).
Almost surely, 2104443121641003 is an apocalyptic number.
104443121641003 is a deficient number, since it is larger than the sum of its proper divisors (1).
104443121641003 is an equidigital number, since it uses as much as digits as its factorization.
104443121641003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27648, while the sum is 34.
Adding to 104443121641003 its reverse (300146121344401), we get a palindrome (404589242985404).
The spelling of 104443121641003 in words is "one hundred four trillion, four hundred forty-three billion, one hundred twenty-one million, six hundred forty-one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •