Properties of the Number -1431

Four Hundred Thirty-One

Basics

Value: -1432 → -1431 → -1430

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 53

Divisors: 1, 3, 9, 27, 53, 159, 477, 1431

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: Yes

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: -10110010111

Octal: -2627

Duodecimal: -9B3

Hexadecimal: -597

Square: 2047761

Square Root: 37.82856063875548

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

Sequence is {a(3,n)}, where a(m,n) is defined at sequence A110665. A110668

∏_n>=1 1 / (1 - a(n)*xⁿ) = 1 + ∑_n>=1 σ(n)*xⁿ, where σ = A000203. A353947

Expansion of 1 / ∑_k>=0 x^{k*(3·k - 2}). A363275

a(n) = -(1/2)*(n+2)*(n² - 6·n - 1). A28494

Expansion of (1-x)^-1/(1-x²+x³). A77883

a(n) = μ(n) * A000217(n). A125287

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

Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)*T(n-1, k) + (n-k-2) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^n-1. A306547

a(1) = 1; a(n) = -(1/2) * ∑_{d∣n, d > 1} d * (d + 1) * a(n/d). A334879

Expansion of e.g.f. (2 - exp(x))³. A377398