Properties of the Number -44515

Forty-Four Thousand Five Hundred Fifteen

Basics

Value: -44516 → -44515 → -44514

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 5 × 29 × 307

Divisors: 1, 5, 29, 145, 307, 1535, 8903, 44515

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010110111100011

Octal: -126743

Duodecimal: -21917

Hexadecimal: -ade3

Square: 1981585225

Square Root: 210.98578151145637

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

MM-numbers of crossing, capturing multiset partitions (with empty parts allowed). A326259

Expansion of o.g.f. x³/((1-2·x)³*(1-3·x)²). A369421

G.f. A(x) satisfies A(x) = 1 + x·A(x)/A(-x·A(x))³. A385015

Number of n X n arrays of squares of integers with every (n-1)X(n-1) subblock summing to 16. A159398

Number of (n+2) X (3+2) 0..4 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order. A252956

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A385015. A385019

Number of n X n arrays of squares of integers with every 3X3 subblock summing to 16. A159216

Rank of the partition of n formed by the terms of its binary expansion from largest to smallest. A380207