Properties of the Number 23148

Twenty-Three Thousand One Hundred Forty-Eight

Basics

Value: 23147 → 23148 → 23149

Parity: even

Prime: No

Previous Prime: 23143

Next Prime: 23159

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 643

Divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36, 643

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101101001101100

Octal: 55154

Duodecimal: 11490

Hexadecimal: 5a6c

Square: 535829904

Square Root: 152.1446679972716

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

a(n) = ∑_k=0..n (k+1) * 3^k * binomial(2·n+2,n-k). A383832

Triangle T(n,k) read by rows: coefficient [x^n-k] of the characteristic polynomial of the n X n matrix A(r,c)=1 (if c > r) and A(r,c)=c (if c <= r). A158359

Numbers n such that 2·n + prime(n) is a square. A256246

G.f. A(x) satisfies: A'(x)/2 = Series_Reversion( x - x·A'(x) - A(x) ). A259611

Array read by ascending antidiagonals: A(n, k) = ∑_j=0..n binomial(k, j)*|Stirling1(n, j)|. A387152

a(n) = (n - 1)!*(2 + Harmonic(n - 1)) if n >= 1, and a(0) = 1. A387205

Number of mobiles (circular rooted trees) with n nodes and 4 leaves. A55342

Let R(i,j) be the rectangle with antidiagonals 1; 2,3; 4,5,6; ...; the n-th Fibonacci number is in antidiagonal a(n). A57042

Number of 4-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions. A187299

Number of (n+1) X (6+1) 0..2 arrays colored with the upper median value of each 2 X 2 subblock. A235952