Properties of the Number -566

Five Hundred Sixty-Six

Basics

Value: -567 → -566 → -565

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 283

Divisors: 1, 2, 283, 566

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1000110110

Octal: -1066

Duodecimal: -3B2

Hexadecimal: -236

Square: 320356

Square Root: 23.790754506740637

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

Coefficients of the '3rd-order' mock θ function ν(q). A53254

a(n) = nearest integer to n² * sin(sqrt(n)). A274088

Take alternate terms of A274088 and A274090. A274091

E.g.f. C(x) is defined by: C(x) = 2 + Integral A(x)*B(x)² - A(x)²*B(x) dx, where A(x) and B(x) are described by A278746 and A278747, respectively. A278748

Expansion of ∏_k>=1 (1 - x^2·k)^2·k/(1 - x^2·k-1)^2·k-1. A281781

G.f. A(x) satisfies: A(x) = 1 - x·A(x/(1 - x)) / (1 - x)⁴. A346059

Triangle of numerators of dual coefficients of Faulhaber. A201453

a(1) = 1; a(n+1) = a(n) +- (sum of digits of a(1) up to a(n)), with "+" when a(n) is odd, or "-" if even. A332058

Triangle T(n, k) = 1 + (n + k - n·k)*(2·n - k - n*(n-k)), read by rows. A172176

Numerators of continued fraction for left factorial. A56919