Properties of the Number -38413

Thirty-Eight Thousand Four Hundred Thirteen

Basics

Value: -38414 → -38413 → -38412

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 107 × 359

Divisors: 1, 107, 359, 38413

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1001011000001101

Octal: -113015

Duodecimal: -1A291

Hexadecimal: -960d

Square: 1475558569

Square Root: 195.99234678935807

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

Number of permutations of [n] such that the minimal distance between elements of the same cycle equals one, a(1)=1 by convention. A276975

Number T(n,k) of permutations of [n] where the minimal distance between elements of the same cycle equals k (k=n for the identity permutation in S_n); triangle T(n,k), n>=0, 0<=k<=n, read by rows. A276974

Numbers n such that μ(n) + μ(n+1) + μ(n+2) + μ(n+3) + μ(n+4) + μ(n+5) + μ(n+6) = 6. A82967

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 387", based on the 5-celled von Neumann neighborhood. A271545

Number of (s(0), s(1), ..., s(n)) such that s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4, s(n) = 3; also a(n) = T(n,n-3), where T is the array defined in A026082. A26086

Number of ways to place zero or more nonadjacent 1,0 1,1 2,0 2,1 3,2 3,3 4,2 4,3 polyhexes in any orientation on a planar nXnXn triangular grid. A155432