Properties of the Number 20776

Twenty Thousand Seven Hundred Seventy-Six

Basics

Value: 20775 → 20776 → 20777

Parity: even

Prime: No

Previous Prime: 20773

Next Prime: 20789

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 7 ² × 53

Divisors: 1, 2, 4, 7, 8, 14, 28, 49, 53, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 101000100101000

Octal: 50450

Duodecimal: 10034

Hexadecimal: 5128

Square: 431642176

Square Root: 144.138821973818

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 reduced words of length n in the Weyl group D₄₉. A162469

T(n,k)=Number of nXk 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279580

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal. A237015

Numbers k such that 4 is the smallest decimal digit of k³. A291643

Incrementally largest terms in the continued fraction for π. A33089

Distinct entries in continued fraction for π in the order of their appearance. A154883

Values of Newton-Gregory forward interpolating polynomial (1/3)*(n-1)*(2·n+3)*(2·n-1). A30440

Number of Proth primes: number of primes of the form 1 + k·2ⁿ with k odd and k < 2ⁿ. A134876

a(n) = Fibonacci(p) mod p², where p = prime(n). A236395

Incrementally largest terms in the continued fraction for π-2 (cf. A001203). A7541