Properties of the Number -15676

Fifteen Thousand Six Hundred Seventy-Six

Basics

Value: -15677 → -15676 → -15675

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 3919

Divisors: 1, 2, 4, 3919, 7838, 15676

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11110100111100

Octal: -36474

Duodecimal: -90A4

Hexadecimal: -3d3c

Square: 245736976

Square Root: 125.20383380711631

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

Row sums of triangle A135858. A135859

a(n) is the number of ways to partition a square n X n into five rectangles of different dimensions, without any straight cut spanning the entire square. A384208

Numerators of continued fraction convergents to sqrt(865). A42670

Number of length 4 1..(n+2) arrays with no leading or trailing partial sum equal to a prime. A254207

Number of binary strings w of length n for which s, the longest proper suffix of w that appears at least twice in w, is of length 2. A284125

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 72 ones. A31840

Numerator of ∑_k=1..n 1/A077800(k), denominator=A074043. A74042

Sums of least knight's moves from (0,0) to points in the square lattice [-n,n]x[-n,n]. A183047

Number of (n+1) X (1+1) 0..1 arrays colored with the sum of the upper and lower median values of each 2 X 2 subblock. A236323

Trajectory of 1 under map n->11n+1 if n odd, n->n/2 if n even. A33963