Base | Representation |
---|---|
bin | 11001000110101100010110… |
… | …011010111000011101101001 |
3 | 112110221012100102112010020020 |
4 | 121012230112122320131221 |
5 | 103432433413202032131 |
6 | 1030454054224351053 |
7 | 32153636665463064 |
oct | 3106542632703551 |
9 | 473835312463206 |
10 | 110411100424041 |
11 | 321a90a286145a |
12 | 104724b2175489 |
13 | 497b950598941 |
14 | 1d39cd64758db |
15 | cb70a58d5996 |
hex | 646b166b8769 |
110411100424041 has 8 divisors (see below), whose sum is σ = 147219463371840. Its totient is φ = 73605068879472.
The previous prime is 110411100424021. The next prime is 110411100424049. The reversal of 110411100424041 is 140424001114011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110411100424041 - 218 = 110411100161897 is a prime.
It is a super-2 number, since 2×1104111004240412 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110411100424049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 582740301 + ... + 582929738.
It is an arithmetic number, because the mean of its divisors is an integer number (18402432921480).
Almost surely, 2110411100424041 is an apocalyptic number.
It is an amenable number.
110411100424041 is a deficient number, since it is larger than the sum of its proper divisors (36808362947799).
110411100424041 is a wasteful number, since it uses less digits than its factorization.
110411100424041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1165701615.
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 110411100424041 its reverse (140424001114011), we get a palindrome (250835101538052).
The spelling of 110411100424041 in words is "one hundred ten trillion, four hundred eleven billion, one hundred million, four hundred twenty-four thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •