Properties of the Number 19248

Nineteen Thousand Two Hundred Forty-Eight

Basics

Value: 19247 → 19248 → 19249

Parity: even

Prime: No

Previous Prime: 19237

Next Prime: 19249

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 401

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100101100110000

Octal: 45460

Duodecimal: B180

Hexadecimal: 4b30

Square: 370485504

Square Root: 138.737161568197

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+4)X(k+4) binary arrays with every 5X5 subblock commuting with each horizontal and vertical neighbor 5X5 subblock. A186609

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10 (10 maximizes T(1,1)), and no two adjacent values equal. A233691

a(n) = [xⁿ] ((x + 1)*(2·x - 1)*(2·x² - 1))/(2·x² + 2·x - 1)². A331320

Number of compositions of n such that the first part is 1 and the second differences of the parts are in {-5,...,5}. A239555

a(1) = 1; a(n+1) = ∑_{d∣n, gcd(d, n/d) = 1} a(n/d) * a(d). A333051

Let M = the 3 X 3 matrix [1 1 1; 3 1 0; 2 0 0]. Perform Mⁿ * [1 0 0] getting (1, 3, 2; 6, 6, 2; 14, 24, 12; 50, 66, 28; ...) which we string together to form the sequence. A107271

Number of (n+4)X8 binary arrays with every 5X5 subblock commuting with each horizontal and vertical neighbor 5X5 subblock. A186604

Number of (n+1)X(3+1) 0..3 arrays with every 2X2 subblock having the sum of the squares of the edge differences equal to 10, and no two adjacent values equal. A233686

OR-convolution of squares A000290 with themselves. A33459

S(n) - the sum of the areas of the polygons constructed from connecting with a straight line all identical members in the multiplicative table modulo n (finite field). A157023