Base | Representation |
---|---|
bin | 10111111000000111001101… |
… | …111100010001110000001101 |
3 | 111202210222000211220002202210 |
4 | 113320013031330101300031 |
5 | 102231000223300104131 |
6 | 1011201234352541033 |
7 | 31055542133054136 |
oct | 2770071574216015 |
9 | 452728024802683 |
10 | 105011110550541 |
11 | 30506a642a9808 |
12 | b93ba34551779 |
13 | 4679675000670 |
14 | 1bd07ca004c8d |
15 | c218a761b146 |
hex | 5f81cdf11c0d |
105011110550541 has 16 divisors (see below), whose sum is σ = 150902162873280. Its totient is φ = 64572088237440.
The previous prime is 105011110550483. The next prime is 105011110550543. The reversal of 105011110550541 is 145055011110501.
It is not a de Polignac number, because 105011110550541 - 226 = 105011043441677 is a prime.
It is a super-2 number, since 2×1050111105505412 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105011110550499 and 105011110550508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105011110550543) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1044399915 + ... + 1044500456.
It is an arithmetic number, because the mean of its divisors is an integer number (9431385179580).
Almost surely, 2105011110550541 is an apocalyptic number.
It is an amenable number.
105011110550541 is a deficient number, since it is larger than the sum of its proper divisors (45891052322739).
105011110550541 is a wasteful number, since it uses less digits than its factorization.
105011110550541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2088901676.
The product of its (nonzero) digits is 2500, while the sum is 30.
The spelling of 105011110550541 in words is "one hundred five trillion, eleven billion, one hundred ten million, five hundred fifty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •