Properties of the Number 4568

Four Thousand Five Hundred Sixty-Eight

Basics

Value: 4567 → 4568 → 4569

Parity: even

Prime: No

Previous Prime: 4567

Next Prime: 4583

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ³ × 571

Divisors: 1, 2, 4, 8, 571, 1142, 2284, 4568

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 1000111011000

Octal: 10730

Duodecimal: 2788

Hexadecimal: 11d8

Square: 20866624

Square Root: 67.58698099486321

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 nXk 0..2 arrays with new values 0..2 introduced in row major order and no element equal to more than one of its immediate leftward or upward or right-upward antidiagonal neighbors. A209100

Pisot sequence P(4,11), a(0)=4, a(1)=11, a(n+1) is the nearest integer to a(n)²/a(n-1). Evidently satisfies a(n) = 2·a(n-1)+2·a(n-2). A21006

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A280673

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. A281605

Number of integer partitions of n whose differences of all degrees > 1 are nonzero. A325874

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 5 (constant-stress 1 X 1 tilings). A234681

Number of 1-separable partitions of n; see Comments. A239467

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards. A280859

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 3, 4 or 6 king-move adjacent elements, with upper left element zero. A298063

Smallest of four consecutive integers divisible by four consecutive primes respectively. A72555