Properties of the Number 39368

Thirty-Nine Thousand Three Hundred Sixty-Eight

Basics

Value: 39367 → 39368 → 39369

Parity: even

Prime: No

Previous Prime: 39367

Next Prime: 39371

Digit Sum: 29

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 7 × 19 × 37

Divisors: 1, 2, 4, 7, 8, 14, 19, 28, 37, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001100111001000

Octal: 114710

Duodecimal: 1A948

Hexadecimal: 99c8

Square: 1549839424

Square Root: 198.41370920377452

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

Numbers that are the sum of 4 positive 9th powers. A3393

a(0)=4, a(n) = 3·a(n-1) - 4. A115099

a(n) = ∑_{k = 0..n} C(n,k)⁹. A182446

Numbers that are the sum of 8 nonzero 8th powers. A3386

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having the same number of equal edges, and new values 0..1 introduced in row major order. A205318

Numbers which are the sum of two positive cubes and divisible by 37. A102618

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock having the same number of equal edges as its horizontal neighbors and a different number from its vertical neighbors, and new values 0..1 introduced in row major order. A208085

Total number of round trips, each of length 2·n on the graph P₅ (o-o-o-o-o). A198635

c(n) in (sqrt(2))_n = b(n) + c(n)*sqrt(2), where (x)_n is the Pochhammer symbol, b(n) and c(n) are integers. A263688

Number of pairs of polynomials (f,g) in GF(3)[x] satisfying deg(f) <= n, deg(g) <= n and gcd(f,g) = 1. A87290