Properties of the Number 5448

Five Thousand Four Hundred Forty-Eight

Basics

Value: 5447 → 5448 → 5449

Parity: even

Prime: No

Previous Prime: 5443

Next Prime: 5449

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 227

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 227, 454

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010101001000

Octal: 12510

Duodecimal: 31A0

Hexadecimal: 1548

Square: 29680704

Square Root: 73.81056834898374

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

Regular triangle read by rows: T(n,k) is the number of multiset partitions of normal multisets of size n into k blocks, where a multiset is normal if it spans an initial interval of positive integers. A317532

Number of compositions of n whose run-lengths cover an initial interval of positive integers. A329766

Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + j·prime(j)*T(n-2, k-1) with j=3, read by rows. A153648

Number of ways to split an integer partition of n into contiguous subsequences all having different sums. A336131

Indices of the start of a string of 24 consecutive squares whose sum is a square. A94196

a(n) is the smallest number of grains of sand placed at the center square of a (2n-1) X (2n-1) table so that some grains drop off the table by the end of the diffusion process. A259013

Number of partitions of floor(n²/2) with at most n parts and maximal height n. A29895

Numbers k such that k¹⁰ == 1 (mod 11³). A56085

Number of partitions of 2n² whose Ferrers-plot fits within a 2n X 2n box; number of ways to cut a 2n X 2n chessboard into two equal-area pieces along a non-descending line from lower left to upper right. A63074

Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,5,11, Q starts with 4,6, R starts with 2; at each stage the smallest number not yet present in P,Q,R is appended to R; every number appears exactly once in the union of P,Q,R. Sequence gives P. A225376