Properties of the Number 4654

Four Thousand Six Hundred Fifty-Four

Basics

Value: 4653 → 4654 → 4655

Parity: even

Prime: No

Previous Prime: 4651

Next Prime: 4657

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 13 × 179

Divisors: 1, 2, 13, 26, 179, 358, 2327, 4654

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1001000101110

Octal: 11056

Duodecimal: 283A

Hexadecimal: 122e

Square: 21659716

Square Root: 68.22023160324215

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 balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing). A19298

Triangle read by rows: T(n,d) is the number of distinct properly d-dimensional polyominoes (or polycubes) with n cells (n >= 1, d >= 0). A49430

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250797

Number of magic labelings of the prism graph I X C₅ with magic sum n. A244497

Triangle T(n,d) = number of distinct d-dimensional polyominoes (or polycubes) with n cells (0 < d < n). A49429

Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 1: bits 0-6 refer to segments from top to bottom, left to right. A234691

Total number of parts in all partitions of n into odd parts. A67588

a(n) = 1 + 3·n - 2·n². A168244

T(n,k) is the number of n X k 0..2 arrays with every 1 immediately preceded by 0 to the left or above, no 0 immediately preceded by a 0, and every 2 immediately preceded by 0 1 to the left or above. A203181

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction. A250611