Properties of the Number 17557

Seventeen Thousand Five Hundred Fifty-Seven

Basics

Value: 17556 → 17557 → 17558

Parity: odd

Prime: No

Previous Prime: 17551

Next Prime: 17569

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 97 × 181

Divisors: 1, 97, 181, 17557

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100010010010101

Octal: 42225

Duodecimal: A1B1

Hexadecimal: 4495

Square: 308248249

Square Root: 132.5028301584536

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

Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n). A47874

Variant of Sylvester's sequence: a(n+1) = a(n)² - a(n) + 1, with a(1) = 12. A144785

a(n) = 9·n² + 3·n + 1. A82040

Semiprimes in A003215. A113530

Number of permutations of [2n] with longest increasing subsequence of length n. A267433

Maximum value taken on by f(P) = ∑_i=1..n p(i)*p(n+1-i) as {p(1),p(2),...,p(n)} ranges over all permutations P of {1,2,3,...,n}. A87035

Number of permutations of length n with longest increasing subsequence of length 4. A1455

Gaps of 8 in sequence A038593 (upper terms). A38656

Triangle of numbers read by rows: T(n,k) = number of permutations σ of (1,2,...,n) with n - {length of longest increasing subsequence in σ} = k (0<=k<=n-1). A126065

Semiprimes p·q with p < q and 2^p (mod q) == 2^q (mod p). A179839