Properties of the Number 23163

Twenty-Three Thousand One Hundred Sixty-Three

Basics

Value: 23162 → 23163 → 23164

Parity: odd

Prime: No

Previous Prime: 23159

Next Prime: 23167

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 7 × 1103

Divisors: 1, 3, 7, 21, 1103, 3309, 7721, 23163

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101101001111011

Octal: 55173

Duodecimal: 114A3

Hexadecimal: 5a7b

Square: 536524569

Square Root: 152.19395520190676

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

G.f.: ∑_n>=0 xⁿ * ∏_k=1..n (1+x^k)/(1-x^k). A207641

Expansion of ∏_k>=1 (1 + x^k)^{7^(k-1}). A343364

Smallest number m such that A176352(m) = n. A218454

Convoluted convolved Fibonacci numbers G₆^r. A89111

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 113", based on the 5-celled von Neumann neighborhood. A270179

Numbers k such that 371·2^k+1 is prime. A323010

Numbers k such that 101^k-100 is prime. A34926

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 0, 1), (0, 1, 1), (1, 1, -1), (1, 1, 0)}. A151185

Triangle T(n,k), read by rows n>=0 with terms k=1..3ⁿ, where row n lists the coefficients in the n-th iteration of x*(1+x)². A166888

Triangle, read by rows, that transforms diagonals in the table of coefficients of successive iterations of x*(1+x)² (cf. A166888). A166890