ℕ atory
Play Now

Properties of the Number 4754

Four Thousand Seven Hundred Fifty-Four

Basics

Value: 4753 → 4754 → 4755

Parity: even

Prime: No

Previous Prime: 4751

Next Prime: 4759

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 2377

Divisors: 1, 2, 2377, 4754

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1001010010010

Octal: 11222

Duodecimal: 2902

Hexadecimal: 1292

Square: 22600516

Square Root: 68.9492567037528

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

Number of length n inversion sequences avoiding the patterns 102, 201, and 210. A279563
Number of integer partitions of n that can be partitioned into distinct pairs of (possibly equal) parts. A338916
Triangle T, read by rows, equal to a diagonal bisection of A118032 such that diagonal n of T equals diagonal 2n+1 of A118032: T(n,k) = A118032(2n+1-k,k); also equals the matrix product of A118032 and SHIFTUP(A118032). A118045
T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302415
a(n) = (9n2 + 9n + 4)/2. A62123
Column 1 of triangle A118032, where column 1 of the matrix square of A118032 forms a bisection of this sequence. A118034
Take first n bits of the infinite Fibonacci word A003849, regard them as a binary number, then convert it to base 10. A182028
Fixed points of A065191. A65197
T(n,k)=Number of nXk 0..2 arrays with rows in nondecreasing lexicographic order and columns in nonincreasing lexicographic order, but with exactly one mistake. A278627
Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths incorporating each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 3, n >= 2. A214504