Properties of the Number 1411

One Thousand Four Hundred Eleven

Basics

Value: 1410 → 1411 → 1412

Parity: odd

Prime: No

Previous Prime: 1409

Next Prime: 1423

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 17 × 83

Divisors: 1, 17, 83, 1411

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10110000011

Octal: 2603

Duodecimal: 997

Hexadecimal: 583

Square: 1990921

Square Root: 37.5632799419859

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

Number of (w,x,y) such that w,x,y are all in {0,...,n} and |w-x| = |x-y|. A212959

Describe n. Also called the "Say What You See" or "Look and Say" sequence LS(n). A45918

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.12.12 2D tiling (cf. A250122). A299257

Discriminants of imaginary quadratic fields with class number 4 (negated). A13658

Number of increasing arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2. A51336

Number of partitions of n with parts >= 8. A185328

Number of partitions of n in which the least part is 8. A26801

Numbers k such that 5·k + 1 is a square. A36666

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x². A367208

a(n) = 30·n + 1. A128470