Properties of the Number 38766

Thirty-Eight Thousand Seven Hundred Sixty-Six

Basics

Value: 38765 → 38766 → 38767

Parity: even

Prime: No

Previous Prime: 38749

Next Prime: 38767

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 7 × 13 × 71

Divisors: 1, 2, 3, 6, 7, 13, 14, 21, 26, 39

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011101101110

Octal: 113556

Duodecimal: 1A526

Hexadecimal: 976e

Square: 1502802756

Square Root: 196.89083269670022

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

When expressed in base 3 and then interpreted in base 7, is a multiple of the original number. A62884

Number of set partitions of [n] such that for each block b the smallest integer interval containing b has at most four elements and for at least one block c the smallest integer interval containing c has exactly four elements. A320554

Row sums of triangle A067979; also of triangle A067990. A67989

Wiener index of the Moebius ladder M(n). A180857

G.f. A(x) satisfies: -x² = ∑_n=-oo..oo (-1)ⁿ * x^n*(n+1/2) * A(x)^n*(n-1/2). A354647

a(n) = exp(-n) * ∑_k>=0 (k - n)ⁿ * n^k / k!. A337057

Triangle giving number of unbranched catapolytetragons, read by rows. A38766

Array read by antidiagonals: Costs E[m,N] of m-ary Huffman trees of maximum height with N internal nodes (non-leaves) for minimizing absolutely ordered sequences of size n=2N+1; m > 1, N > 0. A98810