Properties of the Number 10766

Ten Thousand Seven Hundred Sixty-Six

Basics

Value: 10765 → 10766 → 10767

Parity: even

Prime: No

Previous Prime: 10753

Next Prime: 10771

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 7 × 769

Divisors: 1, 2, 7, 14, 769, 1538, 5383, 10766

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101000001110

Octal: 25016

Duodecimal: 6292

Hexadecimal: 2a0e

Square: 115906756

Square Root: 103.75933692926145

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 divisors of n! with distinct prime multiplicities. A336414

Total number of split graphs (chordal + chordal complement) on n vertices. A48194

T(n,k)=Number of length n+1 0..k arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero. A250646

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

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 3 - 2^p+1 and 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 4. A50036

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

a(n) = ∑_k=0..3 binomial(6,k)*binomial(n,k). A247608

Triangle T(n,k) read by rows: number of k X k symmetric (0,1)-matrices with exactly n entries equal to 1 and no zero rows or columns. A135589

Least b > p_n² such that [p₁²,p₂²,...,p_n²] in base b is prime, where p_j denotes the j-th prime. A224197

Numbers k whose binary expansion contains 2 adjacent 1's and A391571(k) = k. A391581