Properties of the Number -11081

Eleven Thousand Eighty-One

Basics

Value: -11082 → -11081 → -11080

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 7 × 1583

Divisors: 1, 7, 1583, 11081

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10101101001001

Octal: -25511

Duodecimal: -64B5

Hexadecimal: -2b49

Square: 122788561

Square Root: 105.26632889960588

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

Number of fountains of n coins. A5169

a(n) is the solution to the postage stamp problem with 4 denominations and n stamps. A1209

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 0 vertically. A207305

T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 0 and 1 0 1 vertically. A207918

Number of partitions of n such that the number of parts is divisible by the smallest part. A168657

T(n,k)=Number of (n+1)X(k+1) 0..5 arrays with the permanents of all 2X2 subblocks equal and nonzero. A204763

Number of partitions of n into terms of (1,3)-Ulam sequence, cf. A002859. A199118

a(n) = ∑_k=1..n binomial(k, n mod k). A72951

O.g.f.: 1/(1 - C(1)x/(1 - C(2)x/(1 - C(3)x/(1 - C(4)x/(1 - C(5)x/(1 - C(6)x/(1 -...))))))), a continued fraction, where C(n) are the Catalan numbers A000108. A268646

Number of partitions of n with exactly one prime number. A132381