Properties of the Number -12368

Twelve Thousand Three Hundred Sixty-Eight

Basics

Value: -12369 → -12368 → -12367

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁴ × 773

Divisors: 1, 2, 4, 8, 16, 773, 1546, 3092, 6184, 12368

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11000001010000

Octal: -30120

Duodecimal: -71A8

Hexadecimal: -3050

Square: 152967424

Square Root: 111.21151019566275

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 e.g.f. log(1+x)/exp(sin(x)). A9436

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

Triangle T(n,k) read by rows: number of LCO forests of size n with k leaves, 1 <= k <= n. A175136

Number of irreducible Boolean polynomials of degree n. A169912

Array read by antidiagonals: T(n,k) = number of n-step knight's tours on a (k+2)X(k+2) board summed over all starting positions. A186851

Minimum number of identical bricks of length 1 which, when stacked without mortar in the naive way, form a stack of length >=n. A65071

a(n) = 96·2ⁿ + 80. A305062

Number of partitions of n with equal number of parts congruent to each of 0, 1 and 3 (mod 4). A46767

Number of 4-step knight's tours on an (n+2) X (n+2) board summed over all starting positions. A186853

Expansion of (1-x)*(10·x⁴-20·x³+16·x²-6·x+1)/(1-2·x)⁵. A190051