Properties of the Number -44368

Forty-Four Thousand Three Hundred Sixty-Eight

Basics

Value: -44369 → -44368 → -44367

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 47 × 59

Divisors: 1, 2, 4, 8, 16, 47, 59, 94, 118, 188

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1010110101010000

Octal: -126520

Duodecimal: -21814

Hexadecimal: -ad50

Square: 1968519424

Square Root: 210.63712873090537

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

Number of n-bead necklaces with 3 colors. A1867

Number of integer partitions of n of odd rank. A340692

Table read by antidiagonals: T(n,k) = number of distinct n X k toroidal 0..2 arrays. A184284

a(1) = 0, a(2) = -2; for n > 2, a(n) + a(n-2) - a(n-3) - a(n-5) - ... - a(n-p) = (-1)ⁿ⁺¹*n if n is prime, otherwise = 0, where p = largest prime < n. A2120

Number of 6-cycles in the n X n black bishop graph. A289160

Number of different words that can be formed from an n X n grid of letters, reading horizontally, vertically or diagonally. A34720

Number of necklaces with n beads of 4 colors, no 2 adjacent beads the same color. A106366

Coefficient of·in the reduction by x² -> x+1 of the polynomial p(n,x) defined at Comments. A192957

Triangle read by rows: T(n,k) is the number of Dyck paths with no UUU's and no DDD's, of semilength n and having k UUDUDD's starting at level 0 (0 <= k <= floor(n/3); U=(1,1), D=(1,-1)). A166295

Number of distinct n X 3 toroidal 0..2 arrays. A184280