Properties of the Number 38868

Thirty-Eight Thousand Eight Hundred Sixty-Eight

Basics

Value: 38867 → 38868 → 38869

Parity: even

Prime: No

Previous Prime: 38867

Next Prime: 38873

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 41 × 79

Divisors: 1, 2, 3, 4, 6, 12, 41, 79, 82, 123

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011111010100

Octal: 113724

Duodecimal: 1A5B0

Hexadecimal: 97d4

Square: 1510721424

Square Root: 197.14968932260584

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 no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281400

Number of (w,x,y,z) with all terms in {1,...,n} and |w-x|=|x-y|+|y-z|. A212570

Number of right triangles on a centered hexagonal grid of size n. A241225

Indices where the cumulative sum of cos(2k+1)^2k+1 reaches a record high value. A389559

Expansion of (f(-x)³ / f(-x²))⁶ - 64·x * (f(-x²)³ / f(-x))⁶ in powers of·where f() is a Ramanujan θ function. A258739

Number of n X 2 0..1 arrays with no element equal to more than two of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281394

Number of compositions (c1, c2, ...) of n with each c_i <= φ*c_i-1, where φ = (1 + sqrt(5))/2 = A001622. A393207

a(n)=a(n-1)+a(n-2)-d, where d=a(n/5) if 5 divides n, else d=0; 2 initial terms. A50195

Square array where T(n,k) = ∑_j=0..k C(n+2·j,j)*C(n+2·j,k-j), read by antidiagonals. A137634

If a Fibonacci sequence is formed with first term = number of digits in n and second term = sum of decimal digits in n, then n itself occurs as a term in the sequence after the first two terms. A38868