Properties of the Number -431

Four Hundred Thirty-One

Basics

Value: -432 → -431 → -430

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 431

Divisors: 1, 431

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -110101111

Octal: -657

Duodecimal: -2BB

Hexadecimal: -1af

Square: 185761

Square Root: 20.760539492026695

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

a(n) = 9ⁿ - n⁹. A24110

Table T(m,k)=m^k-k^m (with 0⁰ taken to be 1) as square array read by antidiagonals. A55651

Matrix inverse of triangle A063967. A91698

G.f. satisfies: A(x) = 1/(1 + x·A(x⁵)) and also the continued fraction: 1+x·A(x⁶) = [1;1/x,1/x⁵,1/x²⁵,1/x¹²⁵,...,1/x^{5^(n-1}),...]. A101915

Table T(n,k) = kⁿ - n^k, n, k > 0, read by descending antidiagonals. A220417

Expansion of (1 - 2·x²)/(1 + x)³. Second column of Riordan triangle A248156. A248158

Expansion of f(-x⁶)³ / (f(-x⁴)² * ψ(x)) in powers of·where φ(), f() are Ramanujan θ functions. A262152

Floor(r·a(n-1)) - floor(r·a(n-2)), where r = 3/2, a(0) = 1, a(1) = 1. A275865

a(n) = bin_prime_sum(fibonacci(A001651[n])), where fibonacci(A001651[n]) is A014437[n]. A59878

Value of y in the Diophantine equation x³ + y³ = n·z³ (with x>0 and minimal and x >= y and y ≠ 0). A190580