Base | Representation |
---|---|
bin | 110000101000100101… |
… | …1000000100100110111 |
3 | 100222120200021100011100 |
4 | 1201101023000210313 |
5 | 3202343402234133 |
6 | 115551330141143 |
7 | 10355101216206 |
oct | 1412113004467 |
9 | 328520240140 |
10 | 104441055543 |
11 | 40325286940 |
12 | 182a91217b3 |
13 | 9b05918866 |
14 | 50aabc523d |
15 | 2ab4082e13 |
hex | 18512c0937 |
104441055543 has 48 divisors (see below), whose sum is σ = 167313010176. Its totient is φ = 62249109120.
The previous prime is 104441055491. The next prime is 104441055553. The reversal of 104441055543 is 345550144401.
104441055543 is a `hidden beast` number, since 1 + 0 + 4 + 4 + 4 + 105 + 5 + 543 = 666.
It is not a de Polignac number, because 104441055543 - 28 = 104441055287 is a prime.
It is a super-2 number, since 2×1044410555432 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 104441055498 and 104441055507.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (104441055553) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2486946 + ... + 2528592.
It is an arithmetic number, because the mean of its divisors is an integer number (3485687712).
Almost surely, 2104441055543 is an apocalyptic number.
104441055543 is a deficient number, since it is larger than the sum of its proper divisors (62871954633).
104441055543 is a wasteful number, since it uses less digits than its factorization.
104441055543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42084 (or 42081 counting only the distinct ones).
The product of its (nonzero) digits is 96000, while the sum is 36.
Adding to 104441055543 its reverse (345550144401), we get a palindrome (449991199944).
The spelling of 104441055543 in words is "one hundred four billion, four hundred forty-one million, fifty-five thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •