Properties of the Number -325584

Three Hundred Twenty-Five Thousand Five Hundred Eighty-Four

Basics

Value: -325585 → -325584 → -325583

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 7 × 17 × 19

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1001111011111010000

Octal: -1173720

Duodecimal: -138500

Hexadecimal: -4f7d0

Square: 106004941056

Square Root: 570.5996845424995

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

Triangle read by rows, the inverse Bell transform of n!*binomial(4,n) (without column 0). A11801

Number of 3-element ordered antichains on an unlabeled n-element set; T₁-hypergraphs with 3 labeled nodes and n hyperedges. A56005

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(1,1), d=(1,-2) and have k peaks (i.e., ud's). A108767

a(n) = 6·binomial(n+1, 6). A253946

Eighth column of quadrinomial coefficients. A1919

Convolution of Catalan numbers A000108 with Catalan numbers but C(0)=1 replaced by 3. A38629

Triangle read by rows: T(n,k) is the number of ternary trees with n edges and having k middle edges (n >= 0, k >= 0). A120986

Triangle read by rows: T(n,k) = binomial(n+1,k+1) * binomial(4·n-3·k+1,k) / (n+1), 0<=k<=n. A391047

a(n) = T(7,n), array T given by A048505. A48512

Partial sums of A051878. A50404