Properties of the Number 2768

Two Thousand Seven Hundred Sixty-Eight

Basics

Value: 2767 → 2768 → 2769

Parity: even

Prime: No

Previous Prime: 2767

Next Prime: 2777

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ⁴ × 173

Divisors: 1, 2, 4, 8, 16, 173, 346, 692, 1384, 2768

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 101011010000

Octal: 5320

Duodecimal: 1728

Hexadecimal: ad0

Square: 7661824

Square Root: 52.61178575186362

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

Expansion of (1 - x)/(1 - 2·x - x³). A52980

a(n) = 2·n² + n - 7. A100041

a(n) = ∑_k=1..n binomial(n,k) * d(k), where d(k) = the number of positive divisors of k. A160399

Numbers k such that φ(x) = k has exactly 5 solutions. A60668

Non-palindromic balanced numbers in base 9. A256089

a(n) = a(n-1) + a(m) for n >= 4, where m = 2^p+1 + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(3) = 2. A50061

T(n,k)=number of distinct solutions of sum{i=1..k}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1. A180813

T(n,k)=1/3 the number of nXk 0..2 arrays with every element equal to exactly one or two of its horizontal and vertical neighbors. A185559

T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with no element having a strict majority of its horizontal, vertical and antidiagonal neighbors equal to one. A231710

T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000101 or 00010101. A260106