Properties of the Number -45199

Forty-Five Thousand One Hundred Ninety-Nine

Basics

Value: -45200 → -45199 → -45198

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 7 × 11 × 587

Divisors: 1, 7, 11, 77, 587, 4109, 6457, 45199

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1011000010001111

Octal: -130217

Duodecimal: -221A7

Hexadecimal: -b08f

Square: 2042949601

Square Root: 212.60056443951413

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

This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of triangular numbers. The p-th row (p>=1) contains a(i,p) for i=1 to 2·p-1, where a(i,p) satisfies ∑_i=1..n C(i+1,2)^p = 3·C(n+2,3) * ∑_i=1..2·p-1 a(i,p) * C(n-1,i-1)/(i+2). A87127

T(n,k) = number of n X k arrays with rows being permutations of 0..k-1 and no column j greater than column j-1 in all rows (n, k >= 1). A212855

Number of n X 3 arrays with rows being permutations of 0..2 and no column j greater than column j-1 in all rows. A212850

Number of 6 X n arrays with rows being permutations of 0..n-1 and no column j greater than column j-1 in all rows. A212859

a(n) = 62·n² + 1. A158676

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 55 ones. A31823