Properties of the Number -223317

Two Hundred Twenty-Three Thousand Three Hundred Seventeen

Basics

Value: -223318 → -223317 → -223316

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 3 ⁵ × 919

Divisors: 1, 3, 9, 27, 81, 243, 919, 2757, 8271, 24813

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110110100001010101

Octal: -664125

Duodecimal: -A9299

Hexadecimal: -36855

Square: 49870482489

Square Root: 472.5642813417028

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

Consider all quadruples {a,b,c,d} which reach {k,k,k,k} in n steps under map {a,b,c,d}->{|a-b|,|b-c|,|c-d|,|d-a|}; look at max{a,b,c,d}; sequence gives minimal value of this. A45794

Minimum value t such that all quadruples of Diffy_length >= n have a maximal value >= t. A65678

Tribonacci sequences A000073 and A001590 interleaved. A213816

a(n) = T(2n+1), where T(n) are the tribonacci numbers A000073. A73717

a(n) = ((1+(-1)ⁿ)*T(n+1) + (1-(-1)ⁿ)*S(n))/2, where T(n) = tribonacci numbers A000073, S(n) = generalized tribonacci numbers A001644. A75536

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

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

Inverse Moebius transform of tribonacci numbers (A000073). A357238