Properties of the Number 38736

Thirty-Eight Thousand Seven Hundred Thirty-Six

Basics

Value: 38735 → 38736 → 38737

Parity: even

Prime: No

Previous Prime: 38729

Next Prime: 38737

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 269

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001011101010000

Octal: 113520

Duodecimal: 1A500

Hexadecimal: 9750

Square: 1500477696

Square Root: 196.8146336022807

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

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302224

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302670

Keys added to a map T initialized with T[1] = 1 and updated at each iteration according to T[value] := (T[value] if defined else 0) + key, for all (key, value) pairs already in T; listed in order the keys are added to the map (cf. comments for details). A390939

Numbers k that have at least two different representations as the product of a number and of its decimal digits. A336944

a(n) = permanent M_n where M_n is the n X n matrix m(i,j) = i³ + j³. A278925

Number of permutations of {1,...,n} avoiding adjacent step pattern up, down, down, up, down, down. A177538

Number of 4Xn 0..1 arrays with every element equal to 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302227

Value of T[4] after the n-th iteration, when the map T is initialized with T[1] = 1 and in subsequent iterations, T[v] = k + (T[v] if defined else 0) for all key-value pairs (k, v) in T; a(n) = 0 if T[4] isn't defined yet. A390944

Expansion of ∏_k>=0 1/(1-x^3·k+1)⁴. A261635

Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to or 1 greater than any west or northeast neighbors modulo n and the upper left element equal to 0. A267739