Properties of the Number -430

Four Hundred Thirty

Basics

Value: -431 → -430 → -429

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 43

Divisors: 1, 2, 5, 10, 43, 86, 215, 430

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110101110

Octal: -656

Duodecimal: -2BA

Hexadecimal: -1ae

Square: 184900

Square Root: 20.73644135332772

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

Coefficients of the eighth-order mock θ function T₀(q). A153155

Expansion of ∏_k>=1 (1 + x^k)^λ(k) where λ(k) is the Liouville function, A008836. A118207

Inverse of coordination sequence array A113413. A80245

Coefficients in the power series A(x) such that: A(x) = ∑_n=-oo..+oo xⁿ * (1 - xⁿ⁺¹)ⁿ⁺¹ * A(x)ⁿ. A357201

Partial alternating sums of the sum of the bi-unitary divisors function (A188999). A370904

a(n) = ∑_k=1..n (-1)^k-1 * binomial(k+1,2) * floor(n/k). A366937

G.f. ∑_n=-oo..+oo (xⁿ - x)ⁿ⁺¹. A378582

Row sums of triangle A132898. A132899

Triangle read by rows: T(n, k) = 2^k - binomial(n+1, k+1) - ((2·k-n)/(k+1)) * binomial(n+1, k). A156864

Triangle T(n,m) of the coefficients [x^m] of the polynomial ((x-1)*(x+2)*(x+1))ⁿ, 0<=m<=3n. A166235