Properties of the Number 14433

Fourteen Thousand Four Hundred Thirty-Three

Basics

Value: 14432 → 14433 → 14434

Parity: odd

Prime: No

Previous Prime: 14431

Next Prime: 14437

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 17 × 283

Divisors: 1, 3, 17, 51, 283, 849, 4811, 14433

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11100001100001

Octal: 34141

Duodecimal: 8429

Hexadecimal: 3861

Square: 208311489

Square Root: 120.13742131409347

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

G.f.: 1/G(0) where G(k) = 1 + (-q)^k+1 / (1 - (-q)^k+1/G(k+1) ). A227310

T(n,k)=Number of length n+3 0..k arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms. A249707

Coefficient of x^-n in expansion of continued fraction 0, x, x², x³, x⁴, ... . A49346

G.f. A(x) satisfies: A(x) = x * (1 + A(x))⁴ / (1 - 3·A(x)). A366015

a(n) = ∑_{k=0..floor(n/2)} binomial(k+2,2) * binomial(k,2*(n-2·k)). A392252

a(n) = (n!)² * ∑_k=0..n 2^n-k / (k!)². A336804

a(n) = n*(25·n - 1)/2. A22282

a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = (natural numbers >= 2), t = (Fibonacci numbers). A24309

Number of 0..n arrays x(0..3) of 4 elements with nondecreasing average value and 0..n occur with instance counts within one of each other. A200943

Number of length 3+3 0..n arrays with every four consecutive terms having the maximum of some two terms equal to the minimum of the remaining two terms. A249709