Properties of the Number -135490

One Hundred Thirty-Five Thousand Four Hundred Ninety

Basics

Value: -135491 → -135490 → -135489

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 × 5 × 17 × 797

Divisors: 1, 2, 5, 10, 17, 34, 85, 170, 797, 1594

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -100001000101000010

Octal: -410502

Duodecimal: -664AA

Hexadecimal: -21142

Square: 18357540100

Square Root: 368.0896629898753

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

G.f. satisfies A(x) = 1 + x/A(x)*(1 + 1/A(x)). A364394

Number of paths from (0,0) to (3n,0) that stay in the first quadrant, consist of steps u=(2,1), U=(1,2), or d=(1,-1) and do not touch the x-axis, except at the endpoints. A108424

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k returns to the x-axis. A108435

a(n) = n·Fibonacci(n) + binomial(n, 2). A132920

Consecutive states of the linear congruential pseudo-random number generator (1597·s + 51749) mod 244944 when started at s=1. A385359

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and having abscissa of first return equal to 3k. A108439