Properties of the Number -16450

Sixteen Thousand Four Hundred Fifty

Basics

Value: -16451 → -16450 → -16449

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 ² × 7 × 47

Divisors: 1, 2, 5, 7, 10, 14, 25, 35, 47, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000001000010

Octal: -40102

Duodecimal: -962A

Hexadecimal: -4042

Square: 270602500

Square Root: 128.2575533838066

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

Expansion of ∏_k>0 (1 - x^k)^5·k. A316464

T(n,k) = Number of (n+2) X (k+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits. A262759

Numbers k > 1 such that, in base 8, k and k² contain the same digits in the same proportion. A61662

Regular triangle where T(n,k) is the number of pairs of set partitions of {1,...,n} with join of length k. A318392

a(n) = floor(C(n,4)/5). A11795

Triangle of numbers generated by the Nekrasov-Okounkov formula. A210590

Expansion of r(q)⁵ / r(q⁵) in powers of q where r() is the Rogers-Ramanujan continued fraction. A285630

a(n) = (1/(8·n)) * ∑_d∣n μ(n/d) * binomial(8·d,d). A346582

a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads. A51170

Triangle read by rows of coefficients of polynomials generated by the Han/Nekrasov-Okounkov formula. A234937