Properties of the Number -121415

One Hundred Twenty-One Thousand Four Hundred Fifteen

Basics

Value: -121416 → -121415 → -121414

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 5 × 7 × 3469

Divisors: 1, 5, 7, 35, 3469, 17345, 24283, 121415

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11101101001000111

Octal: -355107

Duodecimal: -5A31B

Hexadecimal: -1da47

Square: 14741602225

Square Root: 348.44655257298786

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

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) = T(3n+1), where T(n) are tribonacci numbers A000073. A74581

Inverse Moebius transform of Fibonacci numbers 0, 1, 1, 2, 3, 5, 8, ... A108046

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

a(n) = ceiling(n*φ¹⁷), where φ is the golden ratio, A001622. A4972

Sequences A001644 and A000073 interleaved. A75676

a(n) is the sum of the (1,2)- and (1,3)-entries of the matrix Pⁿ + Tⁿ, where the 3 X 3 matrices P and T are defined by P = [0,1,0; 0,0,1; 1,0,0] and T = [0,1,0; 0,0,1; 1,1,1]. A109523