Properties of the Number 16283

Sixteen Thousand Two Hundred Eighty-Three

Basics

Value: 16282 → 16283 → 16284

Parity: odd

Prime: No

Previous Prime: 16273

Next Prime: 16301

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 19 × 857

Divisors: 1, 19, 857, 16283

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111110011011

Octal: 37633

Duodecimal: 950B

Hexadecimal: 3f9b

Square: 265136089

Square Root: 127.6048588416601

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

Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 315", based on the 5-celled von Neumann neighborhood. A281045

Number of Dyck paths such that the sum of the peak-abscissae is n. A129528

Triangle of coefficients of polynomials H(n,x)=(Uⁿ+Lⁿ)/2+(Uⁿ-Lⁿ)/(2d), where U=x+d, L=x-d, d=(x+4)^1/2. A163762

Smallest k > 0 such that (5ⁿ+k)*5ⁿ-1 and (5ⁿ+k)*5ⁿ+1 are a twin prime pair. A212487

The number of partitions of n which represent Chomp positions with Sprague-Grundy value 9. A284782

Coordination sequence for σ-CrFe, Position Xa. A9962

Convolution of (F(2), F(3), F(4), ...) and A001950. A23654

a(n) = ∑_k=1..n binomial(2·n, n-k) * σ(k). A356338

Minimal voucher cost for n distinct positive integer vouchers v₁, v₂, ..., v_n, where the cost is defined as v₁ + v₁*v₂ + v₂*v₃ + ... + v_n-1*v_n. A393145

a(n) = 6ⁿ/8 - 4^n-1 + 2^n-3. A16283