Properties of the Number -159094

One Hundred Fifty-Nine Thousand Ninety-Four

Basics

Value: -159095 → -159094 → -159093

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 13 × 29 × 211

Divisors: 1, 2, 13, 26, 29, 58, 211, 377, 422, 754

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -100110110101110110

Octal: -466566

Duodecimal: -7809A

Hexadecimal: -26d76

Square: 25310900836

Square Root: 398.86589224951285

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

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

Number of positive rational knots with 2n+1 crossings. A51450

Number of incongruent ways to tile a 3 X 2n room with 1x2 Tatami mats. At most 3 Tatami mats may meet at a point. A68928

Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other). A60312

Duplicate of A001224. A102526

a(n)=Sum{T(2i,n-2i): i=0,1,...,[ n/2 ]}, array T as in A049600. A49601

Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: (1/2) times number of linearly inducible orderings of n points in k-dimensional Euclidean space. A87644

Smallest integer divisible by Fibonacci(2n) such that the second partial quotient in the continued fraction expansion of a(n)/φ is 2 (φ is the golden ratio), n >= 2. A88166

Partial sums of A092181. A302562