ℕ atory
Play Now

Properties of the Number -121121

One Hundred Twenty-One Thousand One Hundred Twenty-One

Basics

Value: -121122 → -121121 → -121120

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 8

Digital Root: 8

Palindrome: Yes

Factorization: 7 × 11 3 × 13

Divisors: 1, 7, 11, 13, 77, 91, 121, 143, 847, 1001

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11101100100100001

Octal: -354441

Duodecimal: -5A115

Hexadecimal: -1d921

Square: 14670296641

Square Root: 348.02442443024023

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

Dates after Jan 01 00 in chronological order which are palindromic when they are written according to the format MMDDYY (American standard, short). Leading zeros of the terms are suppressed. A210895
Consider the Post tag system described in A284116 (but adapted to the alphabet {1,2}) ; sequence lists the words that terminate in the empty word. A289675
List of subwords of A003842 arranged in lexicographic order. A213975
Non-primitive words on {1,2,3}. A239018
Number of bipartite graphs with 3 edges on nodes {1..n}. A53526
List of imprimitive words over the alphabet {1,2}. A213972
Unique representation of nonnegative numbers by iterated tribonacci A, B and C sequences. A316713
In the array shown below the n-th row contains all the palindromes that use digits > 0 and have a digit sum of n. The sequence contains the array read by rows. A82266
Even bisection of A260443 (the odd terms): a(n) = A260443(2·n). A277323
After a(1) = 1, the sequence is always extended with the smallest divisor d (not yet present in the sequence) of the last term t. If d doesn't exist, we extend the sequence with tt (t concatenated to itself). If tt doesn't produce a new d, we extend the sequence with ttt, etc. See the Comments section for more details. A348871