Properties of the Number -135137

One Hundred Thirty-Five Thousand One Hundred Thirty-Seven

Basics

Value: -135138 → -135137 → -135136

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 337 × 401

Divisors: 1, 337, 401, 135137

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -100000111111100001

Octal: -407741

Duodecimal: -66255

Hexadecimal: -20fe1

Square: 18262008769

Square Root: 367.6098475285993

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

Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x² + y² + z² = 3·x*y·z. A2559

Alternative version of the Markov tree A327345. A368546

In base 2: n sets a new record for the number of 'Reverse and Add' steps needed to reach a palindrome starting with n. A66144

Irregular triangle read by rows: Maximal numbers of the Markoff triples at level L of the Markoff tree, with members of the triples ordered increasingly. A327345

Composite Markoff numbers. A256395

Second member m₂(n) of the Markoff triple MT(n) with largest member m(n) = A002559(n), and smallest member m₁(n) = A305313(n), for n >= 1. These triples are conjectured to be unique. A305314

The odd Markoff numbers. A388291

Strong pseudoprimes to base 30. A20256

Consider the partition of the positive odd integers into minimal blocks such that concatenation of numbers in each block is an odious number (A000069). Sequence lists the odious numbers obtained in this way. A248477

Non-Fibonacci Markoff numbers. A111032