Base | Representation |
---|---|
bin | 10111101010000010111010… |
… | …110101010010110100100001 |
3 | 111122101112211200102110020002 |
4 | 113222002322311102310201 |
5 | 102114130434102424301 |
6 | 1005141203041025345 |
7 | 30625650530440631 |
oct | 2752027265226441 |
9 | 448345750373202 |
10 | 104044422311201 |
11 | 30173a9aa64729 |
12 | b80460a625255 |
13 | 4609468269308 |
14 | 1b99ac3ba46c1 |
15 | c0667a60616b |
hex | 5ea0bad52d21 |
104044422311201 has 24 divisors (see below), whose sum is σ = 110710618391520. Its totient is φ = 97440968291072.
The previous prime is 104044422311183. The next prime is 104044422311243. The reversal of 104044422311201 is 102113224440401.
It is not a de Polignac number, because 104044422311201 - 238 = 103769544404257 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104044422313201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 961726130 + ... + 961834308.
It is an arithmetic number, because the mean of its divisors is an integer number (4612942432980).
Almost surely, 2104044422311201 is an apocalyptic number.
It is an amenable number.
104044422311201 is a deficient number, since it is larger than the sum of its proper divisors (6666196080319).
104044422311201 is an equidigital number, since it uses as much as digits as its factorization.
104044422311201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109393 (or 109076 counting only the distinct ones).
The product of its (nonzero) digits is 6144, while the sum is 29.
Adding to 104044422311201 its reverse (102113224440401), we get a palindrome (206157646751602).
The spelling of 104044422311201 in words is "one hundred four trillion, forty-four billion, four hundred twenty-two million, three hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •