Properties of the Number -12628

Twelve Thousand Six Hundred Twenty-Eight

Basics

Value: -12629 → -12628 → -12627

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 7 × 11 × 41

Divisors: 1, 2, 4, 7, 11, 14, 22, 28, 41, 44

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11000101010100

Octal: -30524

Duodecimal: -7384

Hexadecimal: -3154

Square: 159466384

Square Root: 112.37437430304117

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

Magnetic susceptibility coefficients for square lattice spin 3/2 Ising model. A10118

Coefficients in the expansion of ([s] + [2s]x + [3s]x² + ...)/([r] + [2r]x + [3r]x² + ...); [ ] = floor, r = sqrt(2), s = r/(1-r). A279631

Number A(n,k) of rooted trees with n nodes and k-colored non-root nodes; square array A(n,k), n>=0, k>=0, read by antidiagonals. A242249

Number of polyiamonds with n cells that tile the plane isohedrally. A75223

a(n) is the largest integer k such that there is an integer m with exactly n nonunitary prime factors and m + A005117(i) is squarefree for 1 <= i <= k. A390138

Quadrinomial coefficients: C(2+n,n) + C(3+n,n) + C(4+n,n). A5718

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k increasing cycles of length >=2 (0<=k<= n/2). A cycle (b(1), b(2), ...) is said to be increasing if, when written with its smallest element in the first position, it satisfies b(1) < b(2) < b(3) < ... . A186757

Number of rooted trees with n nodes and 4-colored non-root nodes. A52763

Number of ways to fill a Young diagram with positive integers summing to n such that all rows and columns are weakly increasing. A323450

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1. A49942