Properties of the Number 39348

Thirty-Nine Thousand Three Hundred Forty-Eight

Basics

Value: 39347 → 39348 → 39349

Parity: even

Prime: No

Previous Prime: 39343

Next Prime: 39359

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 1093

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 1093

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 1001100110110100

Octal: 114664

Duodecimal: 1A930

Hexadecimal: 99b4

Square: 1548265104

Square Root: 198.36330305779848

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) is the number of n-step one or two collinear space at a time queen's tours on a k X k board summed over all starting positions. A187027

a(n) = 1458·n - 18. A157508

a(n) = cpg(3, n) + cpg(4, n) + ... + cpg(n, n) where cpg(m, n) is the n-th m-th-order centered polygonal number. A257052

Composite numbers k such that φ(k + d(k)) = φ(k) + d(k), where φ() = A000010(), d() = A000005(). A63702

Triangle read by rows: T(n,k) = (n+1,k)-th element of (M³-M)/2, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n. A96034

Number of 4-step one or two collinear space at a time queen's tours on an n X n board summed over all starting positions. A187029

Number of (n+1) X 3 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly one clockwise edge increases. A207044

a(n) = ∑_{-n<i<n, -n<j<n, gcd{i,j}=3} (n-|i|)*(n-|j|)/4. A331775

E.g.f. A(x) satisfies A(x) = exp( 3·x * (1 + x) * A(x)^1/3 ). A372155

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having exactly one clockwise edge increases. A207050