Properties of the Number -129921

One Hundred Twenty-Nine Thousand Nine Hundred Twenty-One

Basics

Value: -129922 → -129921 → -129920

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: Yes

Factorization: 3 × 11 × 31 × 127

Divisors: 1, 3, 11, 31, 33, 93, 127, 341, 381, 1023

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -11111101110000001

Octal: -375601

Duodecimal: -63229

Hexadecimal: -1fb81

Square: 16879466241

Square Root: 360.4455576089127

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

Composite numbers k such that k == +-1 (mod 8) and 2^(k-1/2) == 1 (mod k). A6971

Strong pseudoprimes to base 4. A20230

Composite numbers k == 1 (mod 4) such that (1 + i)^k == 1 + i (mod k), where i = sqrt(-1). A270698

Antidiagonal sums of square array A082011. A82014

Pseudoprimes n to base 2 such that n-2 and n-4 are primes. A230488

Pseudotwinprimes p+2 for primes p such that p+2 divides p^p+2+2 and p+2 is composite. A100873

Pseudoprimes divisible by a smaller pseudoprime. A215150

Square array A(n, k) read by antidiagonals downwards: smallest base-n strong Fermat pseudoprime with k distinct prime factors for k, n >= 2. A360184

Fermat pseudoprimes to base 2 that are products of two Mersenne numbers (not necessarily distinct) that are larger than 1. A367229

Palindromic pseudoprimes (base 2). A68445