Base | Representation |
---|---|
bin | 10110110111001101000011… |
… | …011001011011100111101101 |
3 | 111012000112200220101001102111 |
4 | 112313031003121123213231 |
5 | 101134410122141404421 |
6 | 553504151304124021 |
7 | 30115353565626565 |
oct | 2667150331334755 |
9 | 435015626331374 |
10 | 100550610106861 |
11 | 2a047302068a72 |
12 | b33b46ba66611 |
13 | 4414b6055a6c5 |
14 | 1ab89657bdda5 |
15 | b9584360eee1 |
hex | 5b734365b9ed |
100550610106861 has 2 divisors, whose sum is σ = 100550610106862. Its totient is φ = 100550610106860.
The previous prime is 100550610106841. The next prime is 100550610106867. The reversal of 100550610106861 is 168601016055001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 97158773317225 + 3391836789636 = 9856915^2 + 1841694^2 .
It is a cyclic number.
It is not a de Polignac number, because 100550610106861 - 217 = 100550609975789 is a prime.
It is a super-2 number, since 2×1005506101068612 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (100550610106867) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50275305053430 + 50275305053431.
It is an arithmetic number, because the mean of its divisors is an integer number (50275305053431).
Almost surely, 2100550610106861 is an apocalyptic number.
It is an amenable number.
100550610106861 is a deficient number, since it is larger than the sum of its proper divisors (1).
100550610106861 is an equidigital number, since it uses as much as digits as its factorization.
100550610106861 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 43200, while the sum is 40.
The spelling of 100550610106861 in words is "one hundred trillion, five hundred fifty billion, six hundred ten million, one hundred six thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •