Properties of the Number 9136

Nine Thousand One Hundred Thirty-Six

Basics

Value: 9135 → 9136 → 9137

Parity: even

Prime: No

Previous Prime: 9133

Next Prime: 9137

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 571

Divisors: 1, 2, 4, 8, 16, 571, 1142, 2284, 4568, 9136

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10001110110000

Octal: 21660

Duodecimal: 5354

Hexadecimal: 23b0

Square: 83466496

Square Root: 95.58242516278817

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+2) = 2·a(n+1) + 2·a(n); a(0) = 1, a(1) = 3. A28859

Numbers that are the sum of 11 positive 7th powers. A3378

a(n) = 2·a(n-1) + 2·a(n-2) for n > 2, a(0)=1, a(1)=1, a(2)=3. A155020

a(n) = ∑_d∣n d·binomial(n/d+d-2,d-1). A157020

T(n,k) = number of arrays of length n that are sums of k consecutive elements of length n+k-1 permutations of 0..n+k-2, and no two consecutive rises or falls in the latter permutation. A229717

Number of ways to place 2 nonattacking nightriders on an n X n board. A172141

T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 antidiagonally. A229372

T(n,k)=Number of nXk 0..2 arrays avoiding 11 horizontally, 22 vertically and 00 diagonally or antidiagonally. A229380

a(n)*a(n+3) - a(n+1)*a(n+2) = 2ⁿ, given a(0)=1, a(1)=3, a(2)=7. A80882

Number of integer partitions of n whose ω-sequence is strict (no repeated parts). A325250