Base | Representation |
---|---|
bin | 10111101111110110001101… |
… | …111000110100110000101111 |
3 | 111200210122220020020122200021 |
4 | 113233312031320310300233 |
5 | 102142143432124023323 |
6 | 1010044255312143011 |
7 | 30666523246653664 |
oct | 2757661570646057 |
9 | 450718806218607 |
10 | 104443100220463 |
11 | 30308085280754 |
12 | b869932b37a67 |
13 | 4637c32a06734 |
14 | 1bb1104535a6b |
15 | c11c10de905d |
hex | 5efd8de34c2f |
104443100220463 has 2 divisors, whose sum is σ = 104443100220464. Its totient is φ = 104443100220462.
The previous prime is 104443100220451. The next prime is 104443100220521. The reversal of 104443100220463 is 364022001344401.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 104443100220463 - 29 = 104443100219951 is a prime.
It is a super-2 number, since 2×1044431002204632 (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 (104443100220863) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52221550110231 + 52221550110232.
It is an arithmetic number, because the mean of its divisors is an integer number (52221550110232).
Almost surely, 2104443100220463 is an apocalyptic number.
104443100220463 is a deficient number, since it is larger than the sum of its proper divisors (1).
104443100220463 is an equidigital number, since it uses as much as digits as its factorization.
104443100220463 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 34.
Adding to 104443100220463 its reverse (364022001344401), we get a palindrome (468465101564864).
The spelling of 104443100220463 in words is "one hundred four trillion, four hundred forty-three billion, one hundred million, two hundred twenty thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •