Base | Representation |
---|---|
bin | 10111101111110100011101… |
… | …010110101011101000100101 |
3 | 111200210111000122122101122212 |
4 | 113233310131112223220211 |
5 | 102142131100312100424 |
6 | 1010043344105533205 |
7 | 30666425413151156 |
oct | 2757643526535045 |
9 | 450714018571585 |
10 | 104441212221989 |
11 | 303072a6582535 |
12 | b8694a67a4205 |
13 | 46379c1815786 |
14 | 1bb0da58b392d |
15 | c11b502ac10e |
hex | 5efd1d5aba25 |
104441212221989 has 2 divisors, whose sum is σ = 104441212221990. Its totient is φ = 104441212221988.
The previous prime is 104441212221977. The next prime is 104441212222069. The reversal of 104441212221989 is 989122212144401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83871857952964 + 20569354269025 = 9158158^2 + 4535345^2 .
It is a cyclic number.
It is not a de Polignac number, because 104441212221989 - 212 = 104441212217893 is a prime.
It is a super-2 number, since 2×1044412122219892 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104441212223989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52220606110994 + 52220606110995.
It is an arithmetic number, because the mean of its divisors is an integer number (52220606110995).
Almost surely, 2104441212221989 is an apocalyptic number.
It is an amenable number.
104441212221989 is a deficient number, since it is larger than the sum of its proper divisors (1).
104441212221989 is an equidigital number, since it uses as much as digits as its factorization.
104441212221989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 663552, while the sum is 50.
The spelling of 104441212221989 in words is "one hundred four trillion, four hundred forty-one billion, two hundred twelve million, two hundred twenty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •