Properties of the Number 4055

Four Thousand Fifty-Five

Basics

Value: 4054 → 4055 → 4056

Parity: odd

Prime: No

Previous Prime: 4051

Next Prime: 4057

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 811

Divisors: 1, 5, 811, 4055

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111111010111

Octal: 7727

Duodecimal: 241B

Hexadecimal: fd7

Square: 16443025

Square Root: 63.67888189973188

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 A(n,k) of partitions of n into k sorts of parts; square array A(n,k), n>=0, k>=0, read by antidiagonals. A246935

a(n) = ∑_k=1..n k·d(k) where d(k) is the number of divisors of k. A143127

Trajectory of 13 under map n->A006368(n). A180864

Define p(α) to be the number of H-conjugacy classes where H is a Young subgroup of type α of the symmetric group S_n. Then a(n) = sum p(α) where |α| = n and α has at most n parts. A124577

a(n) = 6·n² - 1. A140811

T(n,k) = number of n-bead necklaces labeled with numbers -k..k not allowing reversal, with sum zero and avoiding the pattern z z+1 z+2. A209073

a(n)³ is smallest cube containing exactly n 6's. A48371

T(n,k) = count of degree k monomials in the power sum symmetric polynomials p(μ,k) summed over all partitions μ of n. A209664

Sum of the ninth largest parts of the partitions of n into 10 parts. A326590

Triangle of numerators of coefficients of the polynomial Q_m(n) defined by the recursion Q₀(n)=1; for m >= 1, Q_m(n) = ∑_i=1..n i·Q_m-1(i). For m >= 1, the denominator for all 2·m+1 terms of the m-th row is A053657(m+1). A202339