Properties of the Number 17796

Seventeen Thousand Seven Hundred Ninety-Six

Basics

Value: 17795 → 17796 → 17797

Parity: even

Prime: No

Previous Prime: 17791

Next Prime: 17807

Digit Sum: 30

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 1483

Divisors: 1, 2, 3, 4, 6, 12, 1483, 2966, 4449, 5932

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100010110000100

Octal: 42604

Duodecimal: A370

Hexadecimal: 4584

Square: 316697616

Square Root: 133.40164916521834

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

Expansion of ∏_k>=1 Q(x^k)^k where Q(x) = ∏_k>=1 (1 + x^k). A192065

Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from top row to lower right corner, and no 1 having more than two 1's adjacent. A391823

T(n,k)=Number of length n+5 0..k arrays with every six consecutive terms having the maximum of some three terms equal to the minimum of the remaining three terms. A250336

a(1) = 14, a(n) = smallest number > a(n-1) such that the concatenation of a(n-1) and a(n) is a square. A265152

Numbers n such that the decimal number concat(6,n) is a square. A273361

a(n) = ∑_k=1..n (-1)^n-k*binomial(n,k)*σ(k). A320568

The number of gaps in the set of positive integers which need at most n steps of the Collatz iteration to reach 1. A391769

Numbers k such that h(k) = h(k-1) + h(k-2), where h(k) = A006577(k) + 1 is the length of the sequence {k, f(k), f(f(k)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.) A78418

Numbers n such that h(n) = 2 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.) A78419

Number of n X 4 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent. A163697