Properties of the Number 9757

Nine Thousand Seven Hundred Fifty-Seven

Basics

Value: 9756 → 9757 → 9758

Parity: odd

Prime: No

Previous Prime: 9749

Next Prime: 9767

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 11 × 887

Divisors: 1, 11, 887, 9757

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10011000011101

Octal: 23035

Duodecimal: 5791

Hexadecimal: 261d

Square: 95199049

Square Root: 98.77752780870759

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 compositions of n with no adjacent triples (..., x, y, z, ...) where x < y < z or x > y > z. A344614

Number of nonempty subsets of {1..n} whose geometric mean is an integer. A326027

a(n) = a(n-1) + a(m) for n >= 3, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1 and a(2) = 3. A50069

Partial sums of A365414. A365444

Sums of 7 distinct powers of 3. A38469

Expansion of ∏_k=1..7 (1+x^2·k-1)/(1-x^2·k). A316719

G.f. A(x) satisfies: 1 = ∑_n>=0 ((1+x)ⁿ - 1)ⁿ/(A(x) + 1 - (1+x)ⁿ)ⁿ⁺¹. A323313

Start from the singleton set S = {n}, and unless 1 is already a member of S, generate on each iteration a new set where each odd number k is replaced by 3k+1, and each even number k is replaced by 3k+1 and k/2. a(n) is the size of the set after the first iteration which has produced 1 as a member. A290100

Least k such that 10^2n-1+k is a brilliant number. A84476

G.f. satisfies A(x) = 1 + x·A(x)³ / (1 - x·A(x))². A367232