Properties of the Number 39372

Thirty-Nine Thousand Three Hundred Seventy-Two

Basics

Value: 39371 → 39372 → 39373

Parity: even

Prime: No

Previous Prime: 39371

Next Prime: 39373

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 17 × 193

Divisors: 1, 2, 3, 4, 6, 12, 17, 34, 51, 68

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001100111001100

Octal: 114714

Duodecimal: 1A950

Hexadecimal: 99cc

Square: 1550154384

Square Root: 198.42378889639215

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 8 positive 9th powers. A3397

a(n) = ∑_d∣3 φ(d)*n^3/d. A54602

T(n,k)=Number of (n+1)X(k+1) binary arrays with every 2X2 subblock determinant equal to exactly one or two horizontal and vertical neighbor 2X2 subblock determinants. A186902

T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 2 or 5. A252605

Numbers k such that k | sigma₈(k). A55712

Denominators of continued fraction convergents to sqrt(290). A41545

Obtainable by applying +, * and exponentiation to its own digits. A46469

Define a set of generalized Syracuse sequences starting with x(1)=2·n+1 a positive odd integer, if x(i) is odd prime set x(i+1)=67·x(i)+1, if x(i) is odd not prime set x(i+1)=3·x(i)+1 and if x(i) is even then set x(i+1)=x(i)/2. Then a(n) is the first index i > 1 at which x(i) reaches 1. A300286

Number of (undirected) Hamiltonian paths in n-Moebius ladder. A20875

Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 0, s(1) = 1 = s(n), |s(i) - s(i-1)| <= 1 for i >= 2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also T(n,n-1), where T is the array in A026268. A26270