Base | Representation |
---|---|
bin | 1001100110001001111011… |
… | …0111110010111010011001 |
3 | 1101100200020122201022112100 |
4 | 2121202132313302322121 |
5 | 2340332130401334221 |
6 | 34235035532034013 |
7 | 2136202135425546 |
oct | 231423667627231 |
9 | 41320218638470 |
10 | 10551105105561 |
11 | 33a8775846749 |
12 | 1224a5b902909 |
13 | 5b6c70c93817 |
14 | 28696774dbcd |
15 | 1346d245e926 |
hex | 9989edf2e99 |
10551105105561 has 12 divisors (see below), whose sum is σ = 15652390157092. Its totient is φ = 6843960068256.
The previous prime is 10551105105557. The next prime is 10551105105613. The reversal of 10551105105561 is 16550150115501.
10551105105561 is a `hidden beast` number, since 1 + 0 + 5 + 51 + 1 + 0 + 51 + 0 + 556 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 3819835713600 + 6731269391961 = 1954440^2 + 2594469^2 .
It is not a de Polignac number, because 10551105105561 - 22 = 10551105105557 is a prime.
It is a super-2 number, since 2×105511051055612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10551105805561) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15842499826 + ... + 15842500491.
Almost surely, 210551105105561 is an apocalyptic number.
It is an amenable number.
10551105105561 is a deficient number, since it is larger than the sum of its proper divisors (5101285051531).
10551105105561 is a wasteful number, since it uses less digits than its factorization.
10551105105561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31685000360 (or 31685000357 counting only the distinct ones).
The product of its (nonzero) digits is 18750, while the sum is 36.
The spelling of 10551105105561 in words is "ten trillion, five hundred fifty-one billion, one hundred five million, one hundred five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •