Properties of the Number -27441

Twenty-Seven Thousand Four Hundred Forty-One

Basics

Value: -27442 → -27441 → -27440

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 3049

Divisors: 1, 3, 9, 3049, 9147, 27441

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110101100110001

Octal: -65461

Duodecimal: -13A69

Hexadecimal: -6b31

Square: 753008481

Square Root: 165.65325230734229

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

T(n,k)=Number of nXk 0..3 arrays with no element x(i,j) adjacent to value 3-x(i,j) horizontally, diagonally or antidiagonally, and top left element zero. A232955

Convolution triangle, read by rows, where diagonals are successive self-convolutions of A118351. A118354

Integers that do not appear in A103502. A103504

a(n) = 4·n³ + 5. A243762

a(n) = ∑_k=1..n (-1)^k+1 * floor(n/k)⁴. A344722

a(n) is the smallest positive integer which can be represented as the sum of n distinct nonzero square pyramidal numbers in exactly n ways, or -1 if no such integer exists. A360218

G.f. satisfies: A(x) = 1 + x·exp( ∑_n>=1 A226908(n)*A(xⁿ)*xⁿ/n ), where A(x) = exp( ∑_n>=1 A226908(n)*xⁿ/n ). A226907

Number of n X 3 0..3 arrays with no element x(i,j) adjacent to value 3-x(i,j) horizontally, diagonally or antidiagonally, and top left element zero. A232950

Number of 4Xn 0..3 arrays with no element x(i,j) adjacent to value 3-x(i,j) horizontally, diagonally or antidiagonally, and top left element zero. A232958