Properties of the Number -120001

One Hundred Twenty Thousand One

Basics

Value: -120002 → -120001 → -120000

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 4

Digital Root: 4

Palindrome: No

Factorization: 7 ² × 31 × 79

Divisors: 1, 7, 31, 49, 79, 217, 553, 1519, 2449, 3871

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11101010011000001

Octal: -352301

Duodecimal: -59541

Hexadecimal: -1d4c1

Square: 14400240001

Square Root: 346.4116048864414

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

Coefficients of monic primitive irreducible polynomials over GF(3) listed in lexicographic order. A58949

Smallest multiple of n with digit sum = 4, or 0 if no such number exists, e.g. a(3k)= 0. A69523

Expansion of ∑_k>0 x^2·k/(1-x^k)⁵. A363605

Numbers m such that m^m == m (mod 10^len(m + 2)), where len(m) is the number of digits of m (A055642). A373206

Numbers k such that σ(k) + φ(k) + d(k) = σ(k+1) + φ(k+1) + d(k+1), where σ(k) is the sum of the divisors of k, φ(k) the Euler totient function of k and d(k) the number of divisors of k. A259495

Numbers n such that sum of decimal digits of n equals number of prime divisors of n counted with multiplicity and sum of distinct decimal digits of n equals number of distinct primes dividing n. A280911

Let q be the n-th prime power (A246655), then a(n) = q³ + q² - q; number of solutions to x·y = z·w in the finite field F_q. A367014

Smallest nontrivial multiple of n whose digit sum is the same as that of the digit sum of n. By nontrivial one means a(n) is not equal to n or (10^k)*n. 0 if no such number exists. A87303