Properties of the Number -2135

One Hundred Thirty-Five

Basics

Value: -2136 → -2135 → -2134

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 5 × 7 × 61

Divisors: 1, 5, 7, 35, 61, 305, 427, 2135

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: -100001010111

Octal: -4127

Duodecimal: -129B

Hexadecimal: -857

Square: 4558225

Square Root: 46.20606020859169

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

Fourth column (m=3) of triangle A128494. A128498

Triangle read by rows: T(n, k) = (2·n + 1)! * [y^2·k] [x^2·n+1] arctan(sec(x·y)*sinh(x)). A371688

Triangle T, read by rows, that satisfies matrix equation: T + (T-I)² = C, where C is Pascal's triangle. A120903

Expansion of 1/((1-x)⁴*(1+x)). A2623

Coordination sequence for 3D uniform tiling formed by stacking parallel layers of the 3.3.4.3.4 2D tiling (cf. A219529). A299255

a(n) = n*(n+1)*(4·n+5)/6. A16061

Number of reducible integer partitions of n. A305563

Goodstein sequence starting with 4: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1. A56193

Numbers n such that 97 is the largest prime factor of n² - 1. A181470

If F(n) is the n-th Fibonacci number, then a(2n) = (F(2n+1) + F(n+2))/2 and a(2n+1) = (F(2n+2) + F(n+1))/2. A1224