Properties of the Number -3560

Five Hundred Sixty

Basics

Value: -3561 → -3560 → -3559

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 5 × 89

Divisors: 1, 2, 4, 5, 8, 10, 20, 40, 89, 178

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110111101000

Octal: -6750

Duodecimal: -2088

Hexadecimal: -de8

Square: 12673600

Square Root: 59.665735560705194

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

McKay-Thompson series of class 10b for Monster. A58103

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

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

sin(arctanh(x) + log(x+1)) = 2·x - 1/2!*x² - 4/3!*x³ + 18/4!*x⁴ - 110/5!*x⁵ + ... A13156

Number of increasing arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2. A51336

Number T(n,k) of partitions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the partition; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A261719

Numbers of the form 9·h² + 2·h, for h an integer. A132355

Numbers k such that φ(x) = k has exactly 5 solutions. A60668

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

a(1)=0; thereafter, a(n) is the smallest number such that the addition table for (a(1),...,a(n)) contains n*(n+1)/2 different entries, and the multiplication table for (a(2),...,a(n)) contains n*(n-1)/2 different nonzero entries (the maximum possible in both cases). A337656