Base | Representation |
---|---|
bin | 10111101111110110010110… |
… | …011101011000000111111111 |
3 | 111200210200021020211102212022 |
4 | 113233312112131120013333 |
5 | 102142144230432121343 |
6 | 1010044321450230355 |
7 | 30666526644151163 |
oct | 2757662635300777 |
9 | 450720236742768 |
10 | 104443244020223 |
11 | 30308149468629 |
12 | b8699731253bb |
13 | 4637c56744454 |
14 | 1bb1119688ca3 |
15 | c11c1d851568 |
hex | 5efd967581ff |
104443244020223 has 2 divisors, whose sum is σ = 104443244020224. Its totient is φ = 104443244020222.
The previous prime is 104443244020099. The next prime is 104443244020303. The reversal of 104443244020223 is 322020442344401.
It is a strong prime.
It is an emirp because it is prime and its reverse (322020442344401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 104443244020223 - 210 = 104443244019199 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104443244025223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52221622010111 + 52221622010112.
It is an arithmetic number, because the mean of its divisors is an integer number (52221622010112).
Almost surely, 2104443244020223 is an apocalyptic number.
104443244020223 is a deficient number, since it is larger than the sum of its proper divisors (1).
104443244020223 is an equidigital number, since it uses as much as digits as its factorization.
104443244020223 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 147456, while the sum is 35.
Adding to 104443244020223 its reverse (322020442344401), we get a palindrome (426463686364624).
The spelling of 104443244020223 in words is "one hundred four trillion, four hundred forty-three billion, two hundred forty-four million, twenty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •