Properties of the Number -7644

Six Hundred Forty-Four

Basics

Value: -7645 → -7644 → -7643

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 7 ² × 13

Divisors: 1, 2, 3, 4, 6, 7, 12, 13, 14, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -1110111011100

Octal: -16734

Duodecimal: -4510

Hexadecimal: -1ddc

Square: 58430736

Square Root: 87.42997197757758

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

Expansion of q / (χ(q) * χ(q²) * χ(q³) * χ(q⁶))² in powers of q where χ() is a Ramanujan θ function. A212770

Triangle read by rows: T(n, k) is the number of diagonal dissections of a convex n-gon into k+1 regions. A33282

Triangle obtained by adding a leading diagonal 1,0,0,0,... to A033282. A86810

Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 6 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=3·floor(n/2), read by rows. A238550

Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 9 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=4·floor(n/2), read by rows. A238581

Number of regions in regular n-gon which are quadrilaterals (4-gons) when all its diagonals are drawn. A67151

Triangle read by rows: T(n,k) is the number of Schroeder paths of semilength n containing exactly k peaks but no peaks at level one (n >= 1; 0 <= k <= n-1). A126216

Triangle read by rows: T(n,m) (n >= m >= 1) = number of chambers (or regions) formed by drawing the line segments connecting any two of the (n+1) X (m+1) lattice points in an n X m lattice polygon. A288187

Heinz numbers of integer partitions with as many even parts as odd conjugate parts and as many odd parts as even conjugate parts. A351980

Numbers k such that σ(x) = k has exactly 10 solutions. A60666