Properties of the Number -45296

Forty-Five Thousand Two Hundred Ninety-Six

Basics

Value: -45297 → -45296 → -45295

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 ⁴ × 19 × 149

Divisors: 1, 2, 4, 8, 16, 19, 38, 76, 149, 152

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1011000011110000

Octal: -130360

Duodecimal: -22268

Hexadecimal: -b0f0

Square: 2051727616

Square Root: 212.82856951076846

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) is the total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2 or 3, for 0 <= k <= 3n. A144416

Sum of smallest parts (counted with multiplicity) of all partitions of n. A92309

Array T(n,k) (n >= 1, k >= 0) read by downwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., i] into exactly k nonempty blocks, each of size at most n, for any i in the range n <= i <= k·n. A144510

Expansion of (1 - x)/(1 - 2·x - 2·x² - x³). A77995

Array read by upwards antidiagonals: T(n,k) = total number of partitions of [1, 2, ..., k] into exactly n blocks, each of size 1, 2, ..., k+1, for 0 <= k <= (k+1)*n. A144512

a(n) = ∑_i=1..n ∑_j=1..n ∑_k=1..n ∑_l=1..n (i+j+k+l)!/(4!*i!*j!*k!*l!). A144662

Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section. . A286798

Triangle read by rows. The incomplete Bell transform of the swinging factorials A056040. A352363

a(n) = (n! - 2ⁿ)/8, n >= 4. A123367