Properties of the Number -4083

Eighty-Three

Basics

Value: -4084 → -4083 → -4082

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

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

4938 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

Expansion of g.f. (6 + 5·x - 20·x² - 12·x³ + 12·x⁴ + 3·x⁵)/(1 + x - 5·x² - 4·x³ + 6·x⁴ + 3·x⁵ - x⁶). A216605

Dirichlet convolution of A000027 (identity function) with A349452 (Dirichlet inverse of A011782, 2^n-1). A349569

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 417", based on the 5-celled von Neumann neighborhood. A272019

First differences of number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 467", based on the 5-celled von Neumann neighborhood. A272321

a(n) = ∑_d∣n (-1)^d-1 * d^n/d-1. A359812

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