Properties of the Number 9163

Nine Thousand One Hundred Sixty-Three

Basics

Value: 9162 → 9163 → 9164

Parity: odd

Prime: No

Previous Prime: 9161

Next Prime: 9173

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 7 ² × 11 × 17

Divisors: 1, 7, 11, 17, 49, 77, 119, 187, 539, 833

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001111001011

Octal: 21713

Duodecimal: 5377

Hexadecimal: 23cb

Square: 83960569

Square Root: 95.7235603182414

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

Number of compositions of n that are either strictly increasing or strictly decreasing. A333147

Expansion of ∏_k>=1 1/((1-x^3·k-1)*(1-x^3·k-2))^k. A262883

Take pairs (x,y) with ∑_{j = x..y} j = concatenation of·and y. Sort pairs on y then x. This sequence gives y of each pair. A70153

Numbers of the form 12n+7 for which ∑_i=0..(4n+2) J(i,12n+7) = 0, where J(i,m) is the Jacobi symbol. A165463

Number of 3-row-restricted Baxter slicings of size n. A342289

a(n) = T(3n,n), where T is the array in A026300. A26303

Primitive terms of A389634. A389635

Composite numbers whose prime factors contain no digits other than 1 and 7. A36307

a(n) = 2^[n(n+1) - A000120(n)] * [xⁿ] 1/(1-x)^1/2ⁿ for n>=0, where A000120(n) = number of 1's in binary expansion of n. A134097

G.f. satisfies 1 = ∑_n>=0 xⁿ * (1 + x·A(x)ⁿ)ⁿ / A(x)ⁿ⁺¹. A385913