Properties of the Number -344135

Three Hundred Forty-Four Thousand One Hundred Thirty-Five

Basics

Value: -344136 → -344135 → -344134

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 5 × 11 × 6257

Divisors: 1, 5, 11, 55, 6257, 31285, 68827, 344135

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1010100000001000111

Octal: -1240107

Duodecimal: -14719B

Hexadecimal: -54047

Square: 118428898225

Square Root: 586.6302072004135

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

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250994

Dying rabbits: a(n) = a(n-1) + a(n-2) - a(n-5). A23435

a(0)=1, a(1)=0, a(2)=2, a(3)=1, a(n)=a(n-2)+a(n-3)+a(n-4) for n>3. A167704

Number of (n+1)X(2+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A250988

Number of (6+1)X(n+1) 0..2 arrays with nondecreasing min(x(i,j),x(i,j-1)) in the i direction and nondecreasing absolute value of x(i,j)-x(i-1,j) in the j direction. A251000