Base | Representation |
---|---|
bin | 10111111111111110000100… |
… | …111000000111000001110001 |
3 | 111211201120201012100120121011 |
4 | 113333332010320013001301 |
5 | 102313322022423204221 |
6 | 1012253252214030521 |
7 | 31142545300546156 |
oct | 2777760470070161 |
9 | 454646635316534 |
10 | 105551050600561 |
11 | 306a4a49398a05 |
12 | ba08601348441 |
13 | 46b8562970717 |
14 | 1c0c9ab86c22d |
15 | c309598431e1 |
hex | 5fff84e07071 |
105551050600561 has 2 divisors, whose sum is σ = 105551050600562. Its totient is φ = 105551050600560.
The previous prime is 105551050600537. The next prime is 105551050600579. The reversal of 105551050600561 is 165006050155501.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 99695352379536 + 5855698221025 = 9984756^2 + 2419855^2 .
It is an emirp because it is prime and its reverse (165006050155501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105551050600561 - 25 = 105551050600529 is a prime.
It is a super-2 number, since 2×1055510506005612 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105551050609561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52775525300280 + 52775525300281.
It is an arithmetic number, because the mean of its divisors is an integer number (52775525300281).
Almost surely, 2105551050600561 is an apocalyptic number.
It is an amenable number.
105551050600561 is a deficient number, since it is larger than the sum of its proper divisors (1).
105551050600561 is an equidigital number, since it uses as much as digits as its factorization.
105551050600561 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112500, while the sum is 40.
The spelling of 105551050600561 in words is "one hundred five trillion, five hundred fifty-one billion, fifty million, six hundred thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •