Properties of the Number 3568

Three Thousand Five Hundred Sixty-Eight

Basics

Value: 3567 → 3568 → 3569

Parity: even

Prime: No

Previous Prime: 3559

Next Prime: 3571

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 223

Divisors: 1, 2, 4, 8, 16, 223, 446, 892, 1784, 3568

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 110111110000

Octal: 6760

Duodecimal: 2094

Hexadecimal: df0

Square: 12730624

Square Root: 59.732738092272314

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

Every run of digits of n in base 3 has length 2. A33001

Numbers n such that Bernoulli number B_n has denominator 510. A271634

a(n) = n*(7·n - 1)/2. A22264

Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers): Triangle T(n,k) = number of ways to get k matches for a deck with n cards, 2 of each kind. A59056

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) - m·k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 1, read by rows. A157152

Number of subsets of {1..n} such that every pair of distinct elements has a different quotient. A325860

Triangle read by rows: T(n,k) = number of vertices in a "frame" of size n X k (see Comments in A331457 for definition). A332599

Square array T(n,m) (n>=0, m>=0) read by antidiagonals downwards giving number of rooted triangulations of type [n,m] up to orientation-preserving isomorphisms. A262586

a(n) = Lucas(n+2) - 3. A27961

Number of integer partitions of n such that (length) * (maximum) <= 2·n. A361851