Properties of the Number -13041

Thirteen Thousand Forty-One

Basics

Value: -13042 → -13041 → -13040

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 7 × 23

Divisors: 1, 3, 7, 9, 21, 23, 27, 63, 69, 81

Polygonal

Triangular: Yes

Square: No

Pentagonal: No

Hexagonal: Yes

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -11001011110001

Octal: -31361

Duodecimal: -7669

Hexadecimal: -32f1

Square: 170067681

Square Root: 114.19719786404568

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

Hankel transform of Moebius function A008683. A56227

a(n) = (2·n+1)*(4·n+1). A14634

3 times heptagonal numbers: a(n) = 3·n*(5·n-3)/2. A152773

a(n) = n²*(2·n² - 1); also ∑_k=0..n-1 (2k+1)³. A2593

Triangle T(n, k, j) = T(n-1, k, j) + T(n-1, k-1, j) + (2·j + 1)*prime(j)*T(n-2, k-1, j) with T(2, k, j) = prime(j) and j = 9, read by rows. A153654

Transform of n³ by the Riordan array (1/(1-x²), x). A105636

Numbers k for which nontrivial positive magic squares of exactly 9 different orders with magic sum k exist. For a definition of nontrivial positive magic squares, see A125005. A125016

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. exp(x/(1 - x)^k). A293012

Positive numbers of the form x⁴ - 6·x² * y² + y⁴ (where x,y are integers). A135789

Cyclops triangular numbers. A160717