Properties of the Number -1003

Three

Basics

Value: -1004 → -1003 → -1002

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 17 × 59

Divisors: 1, 17, 59, 1003

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -1111101011

Octal: -1753

Duodecimal: -6B7

Hexadecimal: -3eb

Square: 1006009

Square Root: 31.670175244226233

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

a(0) = -1 and a(n) = (-1)ⁿ⁺¹*(3·n² - n + 4)/2 for n >= 1. A173247

G.f. A(x) satisfies A(x) = 1 + x·A(x)/A(-x·A(x)³)². A384974

Array of coefficients of powers of x² for S(2·n,x)³ with Chebyshev's S polynomials A049310. A220666

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 129", based on the 5-celled von Neumann neighborhood. A270220

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 411", based on the 5-celled von Neumann neighborhood. A271892

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 465", based on the 5-celled von Neumann neighborhood. A272317

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A384974. A384977

Expansion of 1 - x/(1 - x³/(1 - x⁶/(1 - x¹⁰/(1 - x¹⁵/(1 - x²¹/(1 - ... - x^n*(n+1/2)/(1 - ...))))))), a continued fraction. A290976

Martingale win/loss triangle, read by rows: T(n,k) = total number of dollars won (or lost) using the martingale method on all possible n trials that have exactly k losses and n-k wins, for 0 <= k <= n. A355659

a(n) = ∑_{d divides n} q(d), where q(d) = A000009 = number of partitions of d into distinct parts. A47966