Base | Representation |
---|---|
bin | 110011010001011001… |
… | …1010111010000101101 |
3 | 101112012110000210000001 |
4 | 1212202303113100231 |
5 | 3300444010243023 |
6 | 122325400104301 |
7 | 10645342532635 |
oct | 1464263272055 |
9 | 345173023001 |
10 | 110105556013 |
11 | 42771796992 |
12 | 1940a165091 |
13 | a4c933759b |
14 | 548721d6c5 |
15 | 2ce64e86ad |
hex | 19a2cd742d |
110105556013 has 8 divisors (see below), whose sum is σ = 112488715008. Its totient is φ = 107733719184.
The previous prime is 110105555981. The next prime is 110105556079. The reversal of 110105556013 is 310655501011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110105556013 - 25 = 110105555981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110175556013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2810881 + ... + 2849782.
It is an arithmetic number, because the mean of its divisors is an integer number (14061089376).
Almost surely, 2110105556013 is an apocalyptic number.
It is an amenable number.
110105556013 is a deficient number, since it is larger than the sum of its proper divisors (2383158995).
110105556013 is an equidigital number, since it uses as much as digits as its factorization.
110105556013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5661083.
The product of its (nonzero) digits is 2250, while the sum is 28.
The spelling of 110105556013 in words is "one hundred ten billion, one hundred five million, five hundred fifty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •