Properties of the Number -4035

Thirty-Five

Basics

Value: -4036 → -4035 → -4034

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 269

Divisors: 1, 3, 5, 15, 269, 807, 1345, 4035

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: -111111000011

Octal: -7703

Duodecimal: -2403

Hexadecimal: -fc3

Square: 16281225

Square Root: 63.52164985262898

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

Consider n equally spaced points along a line and join every pair of points by a semicircle above the line; a(n) is the number of intersection points. A290447

Number of integer partitions of 2n with reverse-alternating sum -2. A344741

Number of representations of n as a sum of products of distinct pairs of positive integers, considered to be equivalent when terms or factors are reordered. A211856

Number of integer partitions of n where 2*(number of distinct parts) >= (number of parts). A361394

a(n) = n*(9·n - 1)/2. A22266

a(n)=a(n-1)+a(m), where m=2n-2-2^p+1 and 2^p<n-1<=2^p+1, for n >= 4. A50067

Consider the 2^n-1-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once. A70880

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order. A206621

Triangle read by rows in which row n lists numbers k such that the greatest prime factor of k² - 2 is A038873(n), the n-th prime not congruent to 3 or 5 mod 8. A242488

T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 0, 1 or 4 1s. A295275