Properties of the Number -23075

Twenty-Three Thousand Seventy-Five

Basics

Value: -23076 → -23075 → -23074

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 ² × 13 × 71

Divisors: 1, 5, 13, 25, 65, 71, 325, 355, 923, 1775

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -101101000100011

Octal: -55043

Duodecimal: -1142B

Hexadecimal: -5a23

Square: 532455625

Square Root: 151.90457530963312

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

Coefficients in the expansion of ([s] + [2s]x + [3s]x² + ...)/([r] + [2r]x + [3r]x² + ...); [ ] = floor, r = sqrt(3), s = sqrt(2). A279629

Coefficient of x⁴ in expansion of (1+x+x²)ⁿ. A5712

Number of different chromatic polynomials of a simple graph with n nodes. A229048

Numbers n such that σ(φ(n))/σ(n) = 2. A67382

Number of binary words of length n containing no subword 01101. A209888

Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 01101; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows. A277751

a(n) = ∑_k=0..n binomial(n,k) * (2^k + 3^k)^n-k * 3^k². A245105

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, -1, 1), (-1, 0, -1), (1, 0, -1), (1, 1, 0)}. A148581

a(n) = trinomial(2·n, 4) = (1/6)*n*(2·n - 1)*(2·n² + 7·n - 3). A302710