Properties of the Number 4086

Four Thousand Eighty-Six

Basics

Value: 4085 → 4086 → 4087

Parity: even

Prime: No

Previous Prime: 4079

Next Prime: 4091

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 227

Divisors: 1, 2, 3, 6, 9, 18, 227, 454, 681, 1362

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111111110110

Octal: 7766

Duodecimal: 2446

Hexadecimal: ff6

Square: 16695396

Square Root: 63.92182725798755

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

Generalized 26-gonal (or icosihexagonal) numbers: m*(12·m - 11) with m = 0, +1, -1, +2, -2, +3, -3, ... A316724

Numbers n such that Bernoulli number B_n has denominator 798. A272138

Non-deficient numbers with even σ which are not Zumkeller. A171641

Pseudo-random numbers: a (very weak) pseudo-random number generator from the second edition of the C book. A61364

Number of times prime(n) (the n-th prime) occurs as the least prime factor among numbers 1 .. (prime(n)² * prime(n+1)): a(n) = A078898(A251720(n)). A250477

a(n) = prime(n)*prime(n-1) - 1. A23515

T(n,k)=3-loop graph coloring a rectangular array: number of nXk 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223247

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with no 3x3 subblock diagonal sum 0 or 1 and no antidiagonal sum 0 or 1 and no row sum 1 and no column sum 1. A256029

Irregular triangle read by rows: T(n,k) is the number of degree-n permutations without overlaps which furnish k new permutations without overlaps upon the addition of an (n+1)st element, 2 <= k <= 1 + floor(n/2). A259689

Expansion of g.f. A(x,y) satisfying y/x = ∑_n=-oo..+oo x^n*(3·n+1/2) * (A(x,y)^3·n - 1/A(x,y)^3·n+1), as a triangle read by rows. A361050