Properties of the Number 38556

Thirty-Eight Thousand Five Hundred Fifty-Six

Basics

Value: 38555 → 38556 → 38557

Parity: even

Prime: No

Previous Prime: 38543

Next Prime: 38557

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ⁴ × 7 × 17

Divisors: 1, 2, 3, 4, 6, 7, 9, 12, 14, 17

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011010011100

Octal: 113234

Duodecimal: 1A390

Hexadecimal: 969c

Square: 1486565136

Square Root: 196.35681806344286

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

Triangle read by rows: T(n,k) (n>=0, 0<=k<=A002620(n-1)) is the number of permutations of [n] with k nestings. A263776

Triangle, read by rows, where the g.f. of column k, C_k(x), is defined by the recursion: C_k(x) = ( 1 + ∑_n>=1 xⁿ*C_n-1+k(x) )^k+1. A127082

Number of permutations of length n with exactly 2 occurrences of the pattern 2-13. A94218

Numbers k such that the three second-degree cyclotomic polynomials x² + 1, x² - x + 1 and x² + x + 1 are simultaneously prime when evaluated at x=k. A87277

Factor balanced numbers. See Comments for definition. A343153

Triangle read by rows: T(n,k) is number of hex trees with n edges and k nonroot nodes of outdegree 2. A126183

Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {0,1,...,n}. A209995

a(n) = 6·n*(9·n-5). A277984

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 1), (0, 1, 0), (1, 0, -1), (1, 0, 1)}. A150560

Triangular array T(n, k) read by rows: polynomials for the series expansion of the iterated function F^t(x) = ∑_n>=0 (1/x)^2·n-1*P_n(t)/n! with F¹(x) = (x + sqrt(x² + 4))/2 and F²(x) = F¹(F¹(x)). Row n of the triangle give the coefficients of the polynomial P_n(t). A390822