Properties of the Number 38484

Thirty-Eight Thousand Four Hundred Eighty-Four

Basics

Value: 38483 → 38484 → 38485

Parity: even

Prime: No

Previous Prime: 38461

Next Prime: 38501

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 1069

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1001011001010100

Octal: 113124

Duodecimal: 1A330

Hexadecimal: 9654

Square: 1481018256

Square Root: 196.17339269126177

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

Sum of the squarefree parts of the partitions of n into 6 parts. A309481

a(1) = a(2) = 1; for n>2, a(n+1) = a(n) + a(n-1) iff n is prime, otherwise a(n+1) = a(n) + 1. A113050

Triangle read by rows: T(n,k) is the number of n-bead bracelets using exactly k colors with no adjacent beads having the same color. A330341

Number of homeomorphically irreducible multigraphs (or series-reduced multigraphs or multigraphs without nodes of degree 2) on 4 labeled nodes. A60534

Numbers n such that n divides the (right) concatenation of all numbers <= n written in base 7 (most significant digit on right). A61936

Triangle read by rows: row n gives coefficients of expansion of polynomial p(k,n) in powers of k, defined by p(k, 0) = 1, p(k, 1) = 1+2·k; for n>1, p(k,n) = If[Mod[n, 2] == 0, (1 + 2·k)*p(k, n - 1) + n·Binomial[n + 1, n - 1]*k*(k + 1)*p(k, n - 2), (1 + 2·k)*(1 + 3*(p(k, n - 1) - 1))]. A167883

Illustration of Viswanath's constant A078416. A83404

Sums of 2 distinct powers of 8. A38484