Properties of the Number -41075

Forty-One Thousand Seventy-Five

Basics

Value: -41076 → -41075 → -41074

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 5 ² × 31 × 53

Divisors: 1, 5, 25, 31, 53, 155, 265, 775, 1325, 1643

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -1010000001110011

Octal: -120163

Duodecimal: -1B92B

Hexadecimal: -a073

Square: 1687155625

Square Root: 202.66968199511243

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) = sum of n consecutive cubes after n³. A116149

Numbers k such that σ(k) = ψ(k) + τ(k)³. A390297

Column 2 of triangle A113983; also a(n) = A113983(n+1,1) + [A113983²](n,1). A113985

a(n) = floor(sqrt(a(n-1)² + a(n-2)²)), a(1)=100, a(2)=300. A104908

Number of Baxter matrices of size 3 X n. A347673

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 609", based on the 5-celled von Neumann neighborhood. A273210

Total volume of all cubes with side length q such that n = p + q and p <= q. A303383

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = (odd natural numbers). A24473

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = (odd natural numbers). A25093