Base | Representation |
---|---|
bin | 10000000101100111000… |
… | …001101111000001010101 |
3 | 10220200120122100010200211 |
4 | 100011213001233001111 |
5 | 121103113441244221 |
6 | 2203513102005421 |
7 | 142605122220154 |
oct | 20054701570125 |
9 | 3820518303624 |
10 | 1105535103061 |
11 | 396944820934 |
12 | 15a315576871 |
13 | 8033675c89c |
14 | 3b71865b59b |
15 | 1db568a66e1 |
hex | 1016706f055 |
1105535103061 has 4 divisors (see below), whose sum is σ = 1109089878624. Its totient is φ = 1101980327500.
The previous prime is 1105535103047. The next prime is 1105535103089. The reversal of 1105535103061 is 1603015355011.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1105535103061 - 231 = 1103387619413 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 (1105535143061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1777387315 + ... + 1777387936.
It is an arithmetic number, because the mean of its divisors is an integer number (277272469656).
Almost surely, 21105535103061 is an apocalyptic number.
It is an amenable number.
1105535103061 is a deficient number, since it is larger than the sum of its proper divisors (3554775563).
1105535103061 is an equidigital number, since it uses as much as digits as its factorization.
1105535103061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3554775562.
The product of its (nonzero) digits is 6750, while the sum is 31.
The spelling of 1105535103061 in words is "one trillion, one hundred five billion, five hundred thirty-five million, one hundred three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •