Properties of the Number 1257

One Thousand Two Hundred Fifty-Seven

Basics

Value: 1256 → 1257 → 1258

Parity: odd

Prime: No

Previous Prime: 1249

Next Prime: 1259

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 419

Divisors: 1, 3, 419, 1257

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10011101001

Octal: 2351

Duodecimal: 889

Hexadecimal: 4e9

Square: 1580049

Square Root: 35.45419580247167

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

Coordination sequence T1 for Zeolite Code LTA and ρ. A8137

Number of points of norm <= n² in square lattice. A328

Number of unimodal partitions/compositions of n into distinct terms. A72706

Number of different lattice paths running from (0,0) to (n,0) using steps from S = {(k,k) or (k,-k): k positive integer} that never go below the x-axis. A59231

Triangle read by rows: row n is the first row of the matrix M[n]^n-1, where M[n] is the n X n tridiagonal matrix with main diagonal (2,4,4,...) and super- and subdiagonals (1,1,1,...). A124575

Number of partitions of n such that each pair of parts (if any) has a common factor. A200976

a(n) = n² + 3·n - 1. A14209

a(n)=T(n,n), array T as in A049687. Also a(n)=T(2n,2n), array T given by A049639. A49691

Number A(n,k) of lattice paths from {n}^k to {0}^k using steps that decrement one component such that for each point (p₁,p₂,...,p_k) we have p₁<=p₂<=...<=p_k; square array A(n,k), n>=0, k>=0, read by antidiagonals. A227578

Fundamental discriminants of real quadratic number fields with class number 3. A94612