Properties of the Number -2075

Seventy-Five

Basics

Value: -2076 → -2075 → -2074

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 ² × 83

Divisors: 1, 5, 25, 83, 415, 2075

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000011011

Octal: -4033

Duodecimal: -124B

Hexadecimal: -81b

Square: 4305625

Square Root: 45.552167895721496

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

∏_n>=1 (1 + xⁿ)^a(n) = 1 + ∑_n>=1 σ(n) * xⁿ, where σ = A000203. A328776

a(n) = exp(-1) * ∑_k>=0 (k*(k - n))ⁿ / k!. A340823

arcsinh(sin(arcsinh(x)))=x-3/3!*x³+49/5!*x⁵-2075/7!*x⁷+168865/9!*x⁹... A12040

Number of partitions of n into parts >= 3. A8483

Number of partitions of n in which the least part is 3. A26796

Number of subsets S of T={0,1,2,...,n} such that each element of T is the sum of two (not necessarily distinct) elements of S. A66062

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of ∏_j>=1 (1 + j·x^j)^k. A297321

Triangle read by rows: number of connected graphs with k >= 0 edges and n nodes (1<=n<=k+1). A54923

Sum of odd numbers in range 10·n to 10·n+9. A53742

a() = 1,3,... [ A037257 ], differences = 2,... [ A037258 ] and 2nd differences [ A037259 ] are disjoint and monotonic; adjoin next free number to 2nd differences unless it would produce a duplicate in which case ignore. A37257