Properties of the Number 3432

Three Thousand Four Hundred Thirty-Two

Basics

Value: 3431 → 3432 → 3433

Parity: even

Prime: No

Previous Prime: 3413

Next Prime: 3433

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 11 × 13

Divisors: 1, 2, 3, 4, 6, 8, 11, 12, 13, 22

Polygonal

Triangular: No

Square: No

Pentagonal: Yes

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 110101101000

Octal: 6550

Duodecimal: 1BA0

Hexadecimal: d68

Square: 11778624

Square Root: 58.58327406350724

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

Central binomial coefficients: binomial(2·n,n) = (2·n)!/(n!)². A984

a(n) = binomial(n, floor(n/2)). A1405

Swinging factorial, a(n) = 2^{n-(n mod 2})*∏_k=1..n k^(-1^(k+1)). A56040

Triangle formed from even-numbered columns of triangle of expansions of powers of·in terms of Chebyshev polynomials U_n(x). A39599

Catalan's triangle T(n,k) (read by rows): each term is the sum of the entries above and to the left, i.e., T(n,k) = ∑_j=0..k T(n-1,j). A9766

a(n) = 3*(2·n)!/((n+2)!*(n-1)!). A245

Catalan triangle A009766 transposed. A33184

a(n) = binomial coefficient C(n,7). A580

a(n) = ∑_{k = 0..n} binomial(n,floor(k/2))*(-1)^n-k. A126869

T(n,k) = binomial(n,k)*binomial(n+k,k), 0 <= k <= n, triangle read by rows. A63007