Properties of the Number -344732

Three Hundred Forty-Four Thousand Seven Hundred Thirty-Two

Basics

Value: -344733 → -344732 → -344731

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 86183

Divisors: 1, 2, 4, 86183, 172366, 344732

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1010100001010011100

Octal: -1241234

Duodecimal: -1475B8

Hexadecimal: -5429c

Square: 118840151824

Square Root: 587.1388251512584

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

Expansion of (1-x)/(1+x-x²+x³). A78042

Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=0, a(1)=1, a(2)=0. A1590

a(n) = ∑_k=0..n T(n, k), array T as in A047080. A47081

Tribonacci sequences A000073 and A001590 interleaved. A213816

Number of n X 2 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero. A231057

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

Coefficient of·in the reduction of the polynomial (x² + x + 1)ⁿ by x³ -> x² + x + 1. A192807

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 third term 'b' of these quadruples. A34804

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