Properties of the Number 4711

Four Thousand Seven Hundred Eleven

Basics

Value: 4710 → 4711 → 4712

Parity: odd

Prime: No

Previous Prime: 4703

Next Prime: 4721

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 7 × 673

Divisors: 1, 7, 673, 4711

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1001001100111

Octal: 11147

Duodecimal: 2887

Hexadecimal: 1267

Square: 22193521

Square Root: 68.63672486358888

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

Composite and every divisor (except 1) contains the digit 7. A62676

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element both >= and <= some horizontal or antidiagonal neighbor. A232257

Number of distinct values taken by 5⁵^...⁵ (with n 5's and parentheses inserted in all possible ways). A145545

Number of strict non-knapsack integer partitions of n, meaning not every subset has a different sum. A316402

Table in which the g.f. of row n, R(n,x), satisfies ∑_k=-oo..+oo (-1)^k * (x^k + n·R(n,x))^k = 1 + (n+2)*∑_k>=1 (-1)^k * x^k², for n >= 1, as read by antidiagonals. A370020

Expansion of g.f. A(x) satisfying ∑_n=-oo..+oo (-1)ⁿ * (xⁿ + 3·A(x))ⁿ = 1 + 5*∑_n>=1 (-1)ⁿ * x^n². A370023

Column 5 of array illustrated in A089574 and related to A034261. A107600

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having nonzero determinant and commuting with every horizontal or vertical neighbor. A206343

Dirichlet g.f.: ∏_k>=2 1 / (1 - k^-s)⁷. A339322

Inverse Moebius transform of A000056. A350156