Properties of the Number 4045

Four Thousand Forty-Five

Basics

Value: 4044 → 4045 → 4046

Parity: odd

Prime: No

Previous Prime: 4027

Next Prime: 4049

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 5 × 809

Divisors: 1, 5, 809, 4045

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 111111001101

Octal: 7715

Duodecimal: 2411

Hexadecimal: fcd

Square: 16362025

Square Root: 63.60031446463138

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 non-condensed integer partitions of n, or partitions where it is not possible to choose a different divisor of each part. A370320

Expansion of ∏_k>=1 (1 - x^10·k)/(1 - x^k). A261776

Number of primes in the interval [prime(n), prime(n)²]. A54272

Number of subsets of {1..n} that cannot be linearly combined using positive coefficients to obtain n. A365322

Least MM-numbers of multisets of multisets with a given number of distinct representatives (obtainable by vertex-permutations). A330233

Lower triangular matrix T, read by rows, such that T(n,0) = 1 and T(n,k) = T(n-1,k) + T²(n-1,k-1) for k>0, where T² is the matrix square of T. A97712

a(n) = n*(n-th prime) + (n+1)*((n+1)-th prime). A152117

T(n,k)=Number of (n+2)X(k+2) 0..4 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A252811

a(n) = number of steps to reach 0 when starting from k = (n³)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm. A261228

a(n) = 25·n² - 14·n + 2. A154357