Properties of the Number 23153

Twenty-Three Thousand One Hundred Fifty-Three

Basics

Value: 23152 → 23153 → 23154

Parity: odd

Prime: No

Previous Prime: 23143

Next Prime: 23159

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 13 ² × 137

Divisors: 1, 13, 137, 169, 1781, 23153

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101001110001

Octal: 55161

Duodecimal: 11495

Hexadecimal: 5a71

Square: 536061409

Square Root: 152.16109883935513

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

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw. A253326

a(n) is the number of different degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n, i.e., count each degree only once. A60437

Positive numbers y such that y² is of the form x²+(x+137)² with integer x. A157213

Numbers that are the sum of fourth powers of three distinct positive integers in arithmetic progression. A306214

Denominators of continued fraction convergents to sqrt(805). A42553

Numbers k such that the continued fraction for sqrt(k) has period 53. A20392

Number of (n+1)X(5+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw. A253323

Number of (4+1)X(n+1) 0..1 arrays with every 2X2 subblock sum nondecreasing horizontally, vertically and antidiagonally ne-to-sw. A253329

a(n) = position of n³ + (n+1)³ + (n+2)³ in A024975. A24980

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), (-1, 0, 1), (-1, 1, 0), (0, 0, -1), (1, 0, 1)}. A149239