Properties of the Number -121368

One Hundred Twenty-One Thousand Three Hundred Sixty-Eight

Basics

Value: -121369 → -121368 → -121367

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 13 × 389

Divisors: 1, 2, 3, 4, 6, 8, 12, 13, 24, 26

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11101101000011000

Octal: -355030

Duodecimal: -5A2A0

Hexadecimal: -1da18

Square: 14730191424

Square Root: 348.3791038509629

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

Apply partial sum operator twice to Fibonacci numbers. A1924

a(0)=1, a(n) = Fibonacci(2n+4) - (2n+3). A27953

Solution to the Dancing School Problem with n girls and n+2 boys: f(n,2). A79921

Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero. A298285

Difference between n-th Fibonacci number and floored n-th power of Viswanath's constant. A140443

A polynomial coefficient triangle sequence:a(n)=vector(a(n-1)).Reverse(vector(a(n-1));a(0)=1;a(1)=1;a[2]=3;p(x,n)=Sum[a(m)*m!*Binomial[x, m], {m, 0, n}]. A176701

Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 king-move adjacent elements, with upper left element zero. A298281