ℕ atory
Play Now

Properties of the Number 38409

Thirty-Eight Thousand Four Hundred Nine

Basics

Value: 38408 → 38409 → 38410

Parity: odd

Prime: No

Previous Prime: 38393

Next Prime: 38431

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 31 × 59

Divisors: 1, 3, 7, 21, 31, 59, 93, 177, 217, 413

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001011000001001

Octal: 113011

Duodecimal: 1A289

Hexadecimal: 9609

Square: 1475251281

Square Root: 195.9821420436056

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)=Number of (n+1)X(k+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111. A259515
Partial sums of A151782. A151793
Triangle T(n,k): number of ways of partitioning the n-element multiset {1,1,2,3,...,n-1} into exactly k nonempty parts, n>=1 and 1<=k<=n. A241500
a(n) is the number of nonnegative integers k less than 10n such that the decimal representation of k lacks the digit 1, at least one of digits 2,3, at least one of digits 4,5 and at least one of digits 6,7,8,9. A126631
Numbers n such that μ(n) + μ(n+1) + μ(n+2) + μ(n+3) + μ(n+4) + μ(n+5) + μ(n+6) = 6. A82967
a(n) = 49·n2 - 7. A158484
Number of (n+1) X (2+1) 0..1 arrays with each 2 X 2 subblock having clockwise pattern 0000 0001 0101 0111. A259509
Number of (n+1)X(6+1) 0..1 arrays with each 2X2 subblock having clockwise pattern 0000 0001 0101 0111. A259513
Triangular array read by rows. T(n,k) is the number of binary relations R on [n] such that the unique idempotent in {Ri:i>=1} contains exactly k non-arcless strongly connected components, n>=0, 0<=k<=n. A370464
Number of walks within N3 (the first octant of Z3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (0, 1, -1), (1, 0, -1), (1, 1, 1)}. A149533