Properties of the Number -35890

Thirty-Five Thousand Eight Hundred Ninety

Basics

Value: -35891 → -35890 → -35889

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 37 × 97

Divisors: 1, 2, 5, 10, 37, 74, 97, 185, 194, 370

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1000110000110010

Octal: -106062

Duodecimal: -1892A

Hexadecimal: -8c32

Square: 1288092100

Square Root: 189.44656238633627

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

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1. A73

Bisection of tribonacci numbers. A99463

Tribonacci sequences A000073 and A001590 interleaved. A213816

Triangle read by rows: T(n,k) is the k-th generalized Eulerian number of order n and degree 3, n >= 1. A211233

Number of 6-cycles in the n X n king graph. A288920

a(0) = ... = a(3) = 1; a(n) = a(n-4) + ∑_k=0..n-5 a(k) * a(n-k-5). A343305

a(n) is the smallest tribonacci number (A000073) with exactly n distinct prime factors. A359848

Consider the sequence of 4-tuples {0,a,b,c} (c>=a+b; a,b,c>0) which have the smallest integer 'c' required to reach {k,k,k,k} in n steps under map {r,s,t,u}->{|r-s|,|s-t|,|t-u|,|u-r|}. This sequence gives the second term 'a' of these quadruples. A34803

a(n) = 7·a(n-1) - 5·a(n-2) + a(n-3), with initial values a(0) = a(1) = 1, a(2)=4. A192806

Satisfies the tribonacci recurrence: a(n) = a(n-1) + a(n-2) + a(n-3). A282718