Properties of the Number 39144

Thirty-Nine Thousand One Hundred Forty-Four

Basics

Value: 39143 → 39144 → 39145

Parity: even

Prime: No

Previous Prime: 39139

Next Prime: 39157

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 7 × 233

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1001100011101000

Octal: 114350

Duodecimal: 1A7A0

Hexadecimal: 98e8

Square: 1532252736

Square Root: 197.84842683225966

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

Number of permutations of 1..n avoiding adjacent step pattern up, up, up, up. A177523

Triangle read by rows: T(n,k) = number of labeled digraphs with n nodes and k arcs and without directed paths of length >=2, with 0 <= k <= floor(n²/4). A52296

a(n) = Fibonacci(n)*A008653(n) for n>=1, with a(0)=1, where A008653 is the θ series of direct sum of 2 copies of hexagonal lattice. A205967

a(n) = 8·a(n-1) - 14·a(n-2) for n > 1; a(0) = 1, a(1) = 7. A164072

The fourth row of the ED2 array A167560. A167561

"BHK" (reversible, identity, unlabeled) transform of 1,3,5,7... A32100

Triangle read by rows: T(n, m) = binomial(n, m)* ∑_k=0..m binomial(n, k) for 0 <= m <= n. A167024

G.f. satisfies: A(x) = (x + A(A(x)))² where g.f. A(x) = ∑_n>=1 a(n)*x^3·n-1. A212392

Number of nX4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1s. A297758

Numbers whose base-10 representation has the same number of 4's and 8's. A39144