Base | Representation |
---|---|
bin | 10111101110001001101010… |
… | …011100001110010011010101 |
3 | 111200101112001001021020122211 |
4 | 113232021222130032103111 |
5 | 102133241224044401344 |
6 | 1005514541304153421 |
7 | 30655225644241516 |
oct | 2756115234162325 |
9 | 450345031236584 |
10 | 104326541403349 |
11 | 30272701920231 |
12 | b84b223768871 |
13 | 4629c48734275 |
14 | 1ba960823aa0d |
15 | c0db8d0d3334 |
hex | 5ee26a70e4d5 |
104326541403349 has 2 divisors, whose sum is σ = 104326541403350. Its totient is φ = 104326541403348.
The previous prime is 104326541403247. The next prime is 104326541403391. The reversal of 104326541403349 is 943304145623401.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93493293271249 + 10833248132100 = 9669193^2 + 3291390^2 .
It is a cyclic number.
It is not a de Polignac number, because 104326541403349 - 27 = 104326541403221 is a prime.
It is a super-4 number, since 4×1043265414033494 (a number of 57 digits) contains 4444 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (104326541403949) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52163270701674 + 52163270701675.
It is an arithmetic number, because the mean of its divisors is an integer number (52163270701675).
Almost surely, 2104326541403349 is an apocalyptic number.
It is an amenable number.
104326541403349 is a deficient number, since it is larger than the sum of its proper divisors (1).
104326541403349 is an equidigital number, since it uses as much as digits as its factorization.
104326541403349 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3732480, while the sum is 49.
The spelling of 104326541403349 in words is "one hundred four trillion, three hundred twenty-six billion, five hundred forty-one million, four hundred three thousand, three hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •