Properties of the Number 5771

Five Thousand Seven Hundred Seventy-One

Basics

Value: 5770 → 5771 → 5772

Parity: odd

Prime: No

Previous Prime: 5749

Next Prime: 5779

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 29 × 199

Divisors: 1, 29, 199, 5771

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011010001011

Octal: 13213

Duodecimal: 340B

Hexadecimal: 168b

Square: 33304441

Square Root: 75.9670981412348

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

a(n) = floor(n*φ¹¹), where φ is the golden ratio, A001622. A4926

Expansion of ∏_k>=2 1/(1 - x^k)^bigomega(k), where bigomega(k) is the number of prime divisors of k counted with multiplicity (A001222). A293549

G.f. A(x) satisfies A(x) = 1 + x³ * A(x)² / (1 - x). A346503

Bisection (even part) of Chebyshev sequence with Diophantine property. A77409

a(1) = 412; for n > 1, a(n) = a(n-1) + 1 + sum of distinct prime factors of a(n-1) that are < a(n-1). A105211

Positive integers of the form (30·m²+1)/11. A179339

Compound filter (multiplicative order of 2 mod 2n+1 & prime signature of 2n+1): a(n) = P(A002326(n), A046523(2n+1)), where P(n,k) is sequence A000027 used as a pairing function. A292249

n(k) is the minimum n that requires at least k to make 2·Prime[n]+Prime[k] a prime. A114234

Positive numbers y such that y² is of the form x²+(x+199)² with integer x. A159548

The 4k+3 integers corresponding to the record positions in A165601. A166046