Properties of the Number -9451

Four Hundred Fifty-One

Basics

Value: -9452 → -9451 → -9450

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 13 × 727

Divisors: 1, 13, 727, 9451

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10010011101011

Octal: -22353

Duodecimal: -5577

Hexadecimal: -24eb

Square: 89321401

Square Root: 97.21625378505387

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 1/(1 - x*∏_k>=1 1/(1 + x^k)^k). A299212

Number of partitions of 1 into n powers of 1/2; or (according to one definition of "binary") the number of binary rooted trees. A2572

Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3·x, p(n,x) = u·p(n-1,x) + v·p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - x - x². A367208

a(n) = n*(n² + 2·n - 1)/2. A127736

a(n) = 15n² + 3n + 1. A165806

a(n) = 25·n*(n + 1)/2 + 1. A262221

Smallest positive integer which can be represented as the sum of distinct positive cubes in exactly n ways, or 0 if no such integer exists. A275154

a(n) = S(7,n)/S(1,n), where S(r,n) = ∑_{k = 0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )^r. A361891

a(n) = S(7,2·n-1)/S(1,2·n-1), where S(r,n) = ∑_{k = 0..floor(n/2)} ( binomial(n,k) - binomial(n,k-1) )^r. A361892

Centered 15-gonal numbers: a(n) = (15·n² - 15·n + 2)/2. A69128