Properties of the Number 23158

Twenty-Three Thousand One Hundred Fifty-Eight

Basics

Value: 23157 → 23158 → 23159

Parity: even

Prime: No

Previous Prime: 23143

Next Prime: 23159

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 11579

Divisors: 1, 2, 11579, 23158

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101001110110

Octal: 55166

Duodecimal: 1149A

Hexadecimal: 5a76

Square: 536292964

Square Root: 152.17752790737535

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

Expansion of 1/( (1 + x)² * (1 - x²*(1 + x)²) ). A375373

Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 90 ones. A31858

Numbers k such that k-th and (k+1)-st term of A038593 differ by 4. A38635

Number of n X n binary arrays symmetric about both diagonal and antidiagonal with all ones connected only in a 0111-1100-0111 pattern in any orientation. A147372

A(n, k) is the k-th number b > 1 such that b^prime(n+i-1) == 1 (mod prime(n+i)²) for each i = 0..2, with k running over the positive integers; square array, read by antidiagonals, downwards. A319060

Total number of nodes summed over all self-avoiding planar walks starting at (0,0), ending at (n,n), remaining in the first quadrant and using steps (0,1) and (1,0) on or below the diagonal and using steps (1,1), (-1,1), and (1,-1) on or above the diagonal. A277756

Number of cycles of function f(x) = x⁷ mod n. A23158

Number of 6 X n 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 1 0 vertically. A207491