Properties of the Number 1292

One Thousand Two Hundred Ninety-Two

Basics

Value: 1291 → 1292 → 1293

Parity: even

Prime: No

Previous Prime: 1291

Next Prime: 1297

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 17 × 19

Divisors: 1, 2, 4, 17, 19, 34, 38, 68, 76, 323

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100001100

Octal: 2414

Duodecimal: 8B8

Hexadecimal: 50c

Square: 1669264

Square Root: 35.94440151122286

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

Denominators of continued fraction convergents to sqrt(5). A1076

a(n) = n² - 4. A28347

p-INVERT of the positive integers, where p(S) = 1 - S². A290890

Table by antidiagonals of T(n,k) = n·T(n,k-1) + T(n,k-2) starting with T(n,1) = 1. A73133

Array A(n,k) = n·A(n,k-1) + A(n,k-2) read by upward antidiagonals, starting A(n,0) = 0, A(n,1) = 1. A172236

Number of integer partitions of n not containing their mean. A327472

Array read by ascending antidiagonals. A(n, k) = Fibonacci(k, n), where Fibonacci(n, x) are the Fibonacci polynomials. A352361

Number of partition into distinct parts (a₁, a₂, ... , a_m) (a₁ > a₂ > ... > a_m and ∑_k=1..m a_k = n) such that a1 - a2, a2 - a₃, ... , a_m-1 - a_m, a_m are different. A320348

Array A(n, k) = Fibonacci(n+1, k), with A(n, 0) = A(n, n) = 1, read by antidiagonals. A157103

Convolution of A000203 with itself. A385