Properties of the Number -11207

Eleven Thousand Two Hundred Seven

Basics

Value: -11208 → -11207 → -11206

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 7 × 1601

Divisors: 1, 7, 1601, 11207

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10101111000111

Octal: -25707

Duodecimal: -659B

Hexadecimal: -2bc7

Square: 125596849

Square Root: 105.86311916810311

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

sin(sinh(x)+tan(x))=2·x-5/3!*x³-71/5!*x⁵-863/7!*x⁷-11207/9!*x⁹... A13045

Expansion of e.g.f.: exp(tanh(x)+sin(x))=1+2·x+4/2!*x²+5/3!*x³-8/4!*x⁴-71/5!*x⁵... A13129

Number of compositions of n whose multiplicities cover an initial interval of positive integers. A329741

Record high points in A336957. A337646

Expansion of ∑_k>0 x^4·k/(1-x^k)⁵. A363608

Expansion of (1/x) * Series_Reversion( x / (1 + x² * (1 + x)⁴) ). A389155

a(n) = T(n,n-3), where T is the array in A026374. A26382

Number of partitions of n in which every part occurs 1, 4, or 5 times. Also number of partitions of n in which every part is congruent to {1, 3, 4, 5, 7} mod 8. A100853

Odd composite integers m such that A004187(3·m-J(m,45)) == 7·J(m,45) (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol. A340241

Expansion of ∑_k>0 x^4·k/(1+x^k)⁵. A363618