Properties of the Number 4083

Four Thousand Eighty-Three

Basics

Value: 4082 → 4083 → 4084

Parity: odd

Prime: No

Previous Prime: 4079

Next Prime: 4091

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 1361

Divisors: 1, 3, 1361, 4083

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 111111110011

Octal: 7763

Duodecimal: 2443

Hexadecimal: ff3

Square: 16670889

Square Root: 63.89835678638379

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

Eulerian numbers (Euler's triangle: column k=2 of A008292, column k=1 of A173018). A295

a(n) = least k such that the remainder when 16^k is divided by k is n. A128156

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 3, read by rows. A157149

a(n) = 2ⁿ⁺¹ - n - 2, or partial sums of main diagonal of array A125127 of k-step Lucas numbers. A125128

Triangle read by rows: T(n,k) is the number of partitions of an n-set having k blocks of size > 1 (0<=k<=floor(n/2)). A124324

a(n) = ∑_k=0..10 binomial(n,k). A8863

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no 2X2 subblock having x11-x00 less than x10-x01. A251268

T(n,k)=Number of length n+2 0..k arrays with the sum of medians of adjacent triples multiplied by some arrangement of +-1 equal to zero. A253129

T(n,k)=Number of nXk binary arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling two not more than once. A268995

Number of minimally 2-edge-connected non-isomorphic graphs with n nodes. A1072