Properties of the Number -126000

One Hundred Twenty-Six Thousand

Basics

Value: -126001 → -126000 → -125999

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 5 ³ × 7

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -11110110000110000

Octal: -366060

Duodecimal: -60B00

Hexadecimal: -1ec30

Square: 15876000000

Square Root: 354.96478698597696

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 the signed Fubini polynomials in ascending order, F_n(x) = ∑_k=0..n (-1)ⁿ*Stirling2(n,k)*k!*(-x)^k. A278075

Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n). A19538

Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n. A131689

Numbers n such that A048767(n) = n. A48768

Orders of noncyclic simple groups (without repetition). A1034

T(n, k) = ∑_j=0..n-k (-1)^j*binomial(n - k + 1, j)*(n - k + 1 - j)ⁿ. Triangle read by rows, T(n, k) for 1 <= k <= n. A90582

Number of labeled ordered set partitions into 5 parts for n>=1, a(0)=1. A1118

Number of n-step excursions on the 8-dimensional f.c.c. lattice. A271671

Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors. A305540

Number of palindromes of length n using exactly five different symbols. A56456