Properties of the Number -15771

Fifteen Thousand Seven Hundred Seventy-One

Basics

Value: -15772 → -15771 → -15770

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 7 × 751

Divisors: 1, 3, 7, 21, 751, 2253, 5257, 15771

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11110110011011

Octal: -36633

Duodecimal: -9163

Hexadecimal: -3d9b

Square: 248724441

Square Root: 125.58264211267415

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

G.f. satisfies: A(x) = 1/(1 + x·A(x⁷)) and also the continued fraction: 1 + x·A(x⁸) = [1; 1/x, 1/x⁷, 1/x⁴⁹, 1/x³⁴³, ..., 1/x^{7^(n-1}), ...]. A101917

a(n) = a(n-1) + a(n-7), with a(i) = 1 for i = 0..6. A5709

Sum of the squarefree parts of the partitions of n into 4 parts. A309479

Number of partitions p of n such that (1/5)*max(p) is a part of p. A363068

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

Number of compositions of 7·n-3 into parts 1 and 7. A373929

Expansion of 1/(1 - x⁷ - x⁸ - ...). A17901

Number of partitions of n for which (number of occurrences of the least part) = (number of occurrences of greatest part). A236543

Values of m, the main key or generating number for Pythagorean triangles in which S (the odd short leg) and U (the hypotenuse) are twin primes. A51891

Self-convolution square-root of A118191, where A118191 is column 0 of the matrix square of triangle A118190 with A118190(n,k) = (5^k)^n-k. A118195