Base | Representation |
---|---|
bin | 110001001001111110… |
… | …0001011010000100011 |
3 | 101002110202002122012012 |
4 | 1202103330023100203 |
5 | 3212142134144421 |
6 | 120254423423135 |
7 | 10424622511661 |
oct | 1422374132043 |
9 | 332422078165 |
10 | 105561240611 |
11 | 4084a628522 |
12 | 185602b4aab |
13 | 9c53a15c68 |
14 | 5175899c31 |
15 | 2b2c5a495b |
hex | 1893f0b423 |
105561240611 has 48 divisors (see below), whose sum is σ = 119774756640. Its totient is φ = 92700495360.
The previous prime is 105561240593. The next prime is 105561240643. The reversal of 105561240611 is 116042165501.
It is not a de Polignac number, because 105561240611 - 222 = 105557046307 is a prime.
It is a super-2 number, since 2×1055612406112 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105561243611) 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 47 ways as a sum of consecutive naturals, for example, 138713471 + ... + 138714231.
It is an arithmetic number, because the mean of its divisors is an integer number (2495307430).
Almost surely, 2105561240611 is an apocalyptic number.
105561240611 is a deficient number, since it is larger than the sum of its proper divisors (14213516029).
105561240611 is a wasteful number, since it uses less digits than its factorization.
105561240611 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236 (or 1213 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 32.
The spelling of 105561240611 in words is "one hundred five billion, five hundred sixty-one million, two hundred forty thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •