Properties of the Number 23165

Twenty-Three Thousand One Hundred Sixty-Five

Basics

Value: 23164 → 23165 → 23166

Parity: odd

Prime: No

Previous Prime: 23159

Next Prime: 23167

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 × 41 × 113

Divisors: 1, 5, 41, 113, 205, 565, 4633, 23165

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101101001111101

Octal: 55175

Duodecimal: 114A5

Hexadecimal: 5a7d

Square: 536617225

Square Root: 152.2005256232711

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

Fourth binomial transform of F(n+1). A81569

Square array of binomial transforms of Fibonacci numbers, read by ascending antidiagonals. A81572

Numbers k such that 3k-4, 3k-2, 3k+2, and 3k+4 are primes. A173092

Numbers n such that both n*π and n·e are within 1/sqrt(n) of integers. A208530

Numbers 41·k such that 41·k+2 and 41·k-6 are both prime. A153822

Expansion of ∏_k>=1 1/(1 - ∑_j=1..k x^j·k). A319758

Let b(1)=b(2)=1, b(k) = (2^b(k-1)+2^b(k-2)) (mod k); sequence gives values of n such that b(n)=0. A74782

Numbers m such that m²+1 is semiprime with (m-1)²+1 and (m+1)²+1 primes. A321985

Numbers k such that Fibonacci(k) == -5 (mod k). A23165

Number of (n+2)X6 binary arrays avoiding patterns 001 and 000 in rows and columns. A202597