Properties of the Number 9081

Nine Thousand Eighty-One

Basics

Value: 9080 → 9081 → 9082

Parity: odd

Prime: No

Previous Prime: 9067

Next Prime: 9091

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ² × 1009

Divisors: 1, 3, 9, 1009, 3027, 9081

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001101111001

Octal: 21571

Duodecimal: 5309

Hexadecimal: 2379

Square: 82464561

Square Root: 95.29428104561154

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

Triangle, read by rows, where T(n,k) equals the dot product of the vector of terms in row n that are to the right of T(n,k) with the vector of terms in column k that are above T(n,k): T(n,k) = ∑_j=0..n-k-1 T(n,j+k+1)*T(j+k,k) for n > k+1 > 0, with T(n,n) = 1 and T(n,n-1) = n (n>=1). A115080

Column 0 of triangle A115080. A115081

Number of partitions of n containing m(3) as a part, where m denotes multiplicity. A240488

Number of subsets of {1..n} containing n such that every subset has a different sum. A325866

a(n) = ∑_i=0..n digsum₄(i)³, where digsum₄(i) = A053737(i). A231666

Number of partitions of n with even crank. A124227

G.f.: A(x) = exp( ∑_n>=1 A163659(n)²*xⁿ/n ), where x·exp(∑_n>=1 A163659(n)*xⁿ/n) = S(x) is the g.f. of Stern's diatomic series (A002487). A163658

Expansion of 1/sqrt((1 - x⁴ - x⁵)² - 4·x⁹). A376722

Number of n-digit 7-smooth numbers (A002473). A85630

Number of compositions of n in which the maximal multiplicity of parts equals 8. A243125