Properties of the Number 39648

Thirty-Nine Thousand Six Hundred Forty-Eight

Basics

Value: 39647 → 39648 → 39649

Parity: even

Prime: No

Previous Prime: 39631

Next Prime: 39659

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ⁵ × 3 × 7 × 59

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 16

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001101011100000

Octal: 115340

Duodecimal: 1AB40

Hexadecimal: 9ae0

Square: 1571963904

Square Root: 199.11805543445828

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

Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) for n >= 4 with a(0) = a(1) = a(2) = 0 and a(3) = 1. A78

Number of compositions (ordered partitions) of n into parts not greater than sqrt(n). A364526

a(n) is the smallest tetranacci number (A000078) with exactly n distinct prime factors. A359849

a(n) is the smallest tetranacci number (A000078) with exactly n prime factors (counted with multiplicity). A359877

Number of nondecreasing arrangements of 7 numbers x(i) in -(n+5)..(n+5) with the sum of sign(x(i))*x(i)² zero. A188007

Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k DHU's (here U=(1,1), H=(1,0), and D=(1,-1)). A191397

G.f.: ∏_n>=1 ((1-xⁿ)/(1+xⁿ))^2·n. A216406

a(n) = n*(n² + 3·n - 2)/2. A256857

a(n) is the least k such that the average number of bi-unitary divisors of {1..k} is >= n. A344273

a(n) is the smallest Fibonacci n-step number with exactly n distinct prime factors. A359852