Properties of the Number 1582

One Thousand Five Hundred Eighty-Two

Basics

Value: 1581 → 1582 → 1583

Parity: even

Prime: No

Previous Prime: 1579

Next Prime: 1583

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 7 × 113

Divisors: 1, 2, 7, 14, 113, 226, 791, 1582

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11000101110

Octal: 3056

Duodecimal: ABA

Hexadecimal: 62e

Square: 2502724

Square Root: 39.774363602702685

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

A nonlinear binomial sum. A126

The squarefree dual of a multiset partition has, for each vertex, one block consisting of the indices (or positions) of the blocks containing that vertex, counted without multiplicity. Then a(n) is the number of non-isomorphic multiset partitions of weight n whose squarefree dual is strict (no repeated blocks). A319558

Numbers m such that there are precisely 6 groups of order m. A135850

Number of integer partitions of n that cannot be partitioned into a set (or multiset) of sets with distinct sums. A381990

a(n) = n*(8·n+1). A139275

Numbers k such that k³ divides 15^k² - 1. A177915

Triangle read by rows: T(n,k) gives the number of ballot sequences of length n having exactly k descents, n>=0, 0<=k<=n. A238121

T(n,k)=Number of -k..k arrays x(0..n+1) of n+2 elements with zero sum and nonzero first and second differences. A200454

Irregular triangle read by rows: T(n,k) gives the number of ballot sequences of length n having k descents, n>=0, 0<=k<=A083920(n-1). A238122

Numbers k such that 13^k == 15 (mod k). A116639