Properties of the Number 5775

Five Thousand Seven Hundred Seventy-Five

Basics

Value: 5774 → 5775 → 5776

Parity: odd

Prime: No

Previous Prime: 5749

Next Prime: 5779

Digit Sum: 24

Digital Root: 6

Palindrome: Yes

Factorization: 3 × 5 ² × 7 × 11

Divisors: 1, 3, 5, 7, 11, 15, 21, 25, 33, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1011010001111

Octal: 13217

Duodecimal: 3413

Hexadecimal: 168f

Square: 33350625

Square Root: 75.99342076785332

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

Numbers k that divide the (right) concatenation of all numbers <= k written in base 25 (most significant digit on left). A29470

Prime factorization representation of Stern polynomials: a(0) = 1, a(1) = 2, a(2n) = A003961(a(n)), a(2n+1) = a(n)*a(n+1). A260443

Odd abundant numbers (odd numbers m whose sum of divisors exceeds 2m). A5231

Expansion of ∏_m>=1 (1 + m·q^m). A22629

a(n) = 4·n² - 1. A466

Numbers k such that both k and k+1 are abundant. A96399

Odd primitive abundant numbers. A6038

Square array read by antidiagonals downwards: T(n,k) = (n·k)!/(k!ⁿ*n!), (n>=1, k>=1), the number of ways of dividing nk labeled items into n unlabeled boxes with k items in each box. A60540

Numbers m such that m and m+1 are consecutive lazy-Fibonacci-Niven numbers (A328212). A328213

Coefficient triangle of certain polynomials N(4; m,x). A62264