Properties of the Number -410744

Four Hundred Ten Thousand Seven Hundred Forty-Four

Basics

Value: -410745 → -410744 → -410743

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 51343

Divisors: 1, 2, 4, 8, 51343, 102686, 205372, 410744

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1100100010001111000

Octal: -1442170

Duodecimal: -179848

Hexadecimal: -64478

Square: 168710633536

Square Root: 640.8931268160082

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

Trisection of tribonacci numbers. A99464

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

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

Sequences A001644 and A000073 interleaved. A75676

Numbers of the form t_n or t_n + t_n+1 where {t_n} are the tribonacci numbers A000073. A308189

Expansion of -x²*(x⁹-x⁸+2·x⁷-x⁶+x⁵-2·x⁴+x²+1) / ((x⁶-x⁴+x²+1) * (x⁶+x⁴+x²-1)). A114952

Number of compositions (ordered partitions) of n into squarefree parts not greater than sqrt(n). A369220