Base | Representation |
---|---|
bin | 11000000000000111011011… |
… | …111011101110011111000101 |
3 | 111211202112122122010220022001 |
4 | 120000013123323232133011 |
5 | 102314003113340212442 |
6 | 1012302033403105301 |
7 | 31143352330441543 |
oct | 3000073373563705 |
9 | 454675578126261 |
10 | 105561101100997 |
11 | 306a9236665713 |
12 | ba0a547212231 |
13 | 46b94a4c5ccb9 |
14 | 1c0d2825b8d93 |
15 | c30d46d792b7 |
hex | 6001dbeee7c5 |
105561101100997 has 2 divisors, whose sum is σ = 105561101100998. Its totient is φ = 105561101100996.
The previous prime is 105561101100953. The next prime is 105561101101097. The reversal of 105561101100997 is 799001101165501.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 105249255919236 + 311845181761 = 10259106^2 + 558431^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-105561101100997 is a prime.
It is a super-2 number, since 2×1055611011009972 (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 (105561101100937) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52780550550498 + 52780550550499.
It is an arithmetic number, because the mean of its divisors is an integer number (52780550550499).
Almost surely, 2105561101100997 is an apocalyptic number.
It is an amenable number.
105561101100997 is a deficient number, since it is larger than the sum of its proper divisors (1).
105561101100997 is an equidigital number, since it uses as much as digits as its factorization.
105561101100997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 85050, while the sum is 46.
The spelling of 105561101100997 in words is "one hundred five trillion, five hundred sixty-one billion, one hundred one million, one hundred thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •