Properties of the Number -44631

Forty-Four Thousand Six Hundred Thirty-One

Basics

Value: -44632 → -44631 → -44630

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁴ × 19 × 29

Divisors: 1, 3, 9, 19, 27, 29, 57, 81, 87, 171

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1010111001010111

Octal: -127127

Duodecimal: -219B3

Hexadecimal: -ae57

Square: 1991926161

Square Root: 211.26050269749905

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

a(n) = 3a(n-1) + 3a(n-2). a(0) = 1, a(1) = 4. A125145

T(n,k)=Number of nXk binary matrices with no 2X2 block having four 1's. A181253

T(n,k)=Number of nXk 0..3 arrays avoiding 11 horizontally, 22 vertically, 33 antidiagonally and 00 diagonally. A229412

Triangle read by rows, derived from an array of sequences generated from (1 + x)/ (1 - r·x - r·x²). A180165

G.f. A(x) satisfies A(x) = 1 + x*(1+x³)*A(x)³. A386496

Triangle read by rows: T(n,k) is the number of sequences of length n on the alphabet {0,1,2,3}, containing k subsequences 00 (0<=k<=n-1). A128235

Numbers generated by recursive procedure a(n) = nozero(a(n-1) * 3), in which the function nozero(x) removes all zeros from x, starting with a(1) = 1. A243845

a(n) = ∑_{k=0..floor(n/2)} binomial(n-k,k-1)*3^n-k-1. A99581

Numbers m such that both m²-1 and m² are refactorable numbers (A033950) and that m² has more divisors than m²-1. A342970

Numerator of n*(n-2)*(2·n-1)/(2*(n-1)). A22997