Properties of the Number -4041

Forty-One

Basics

Value: -4042 → -4041 → -4040

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 449

Divisors: 1, 3, 9, 449, 1347, 4041

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111111001001

Octal: -7711

Duodecimal: -2409

Hexadecimal: -fc9

Square: 16329681

Square Root: 63.56886030125127

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

Values of n such that L(17) and N(17) are both prime, where L(k) = (n²+n+1)*2^2·k + (2·n+1)*2^k + 1, N(k) = (n²+n+1)*2^k + n. A227520

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

Triangle read by rows, T(n, k) the coefficients of some polynomials in π, for n >= 0 and 0 <= k <= n. A295516

a(n) = n concatenated with n + 1. A1704

Numbers k such that the largest prime factor of k²-1 is 101. A181568

Dispersion of A047219, (numbers >1 and congruent to 1 or 3 mod 5), by antidiagonals. A191727

Number of integer partitions of n whose run-lengths are neither weakly increasing nor weakly decreasing. A332641

Antidiagonal-sums of absolute value of the array A377038(n,k) = n-th term of k-th differences of squarefree numbers (A005117). A377040

T(n,k) is the number of n X k nonnegative integer arrays with new values 0 upwards introduced in row major order and no element equal to more than two of its immediate leftward or upward or right-upward antidiagonal neighbors. A208466

T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1. A180782