Properties of the Number -100672

One Hundred Thousand Six Hundred Seventy-Two

Basics

Value: -100673 → -100672 → -100671

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁶ × 11 ² × 13

Divisors: 1, 2, 4, 8, 11, 13, 16, 22, 26, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11000100101000000

Octal: -304500

Duodecimal: -4A314

Hexadecimal: -18940

Square: 10134851584

Square Root: 317.28851224083104

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

Eigentriangle, row sums = A125275. A147294

a(n) = (n+1)*(n+2)²*(n+3)²*(n+4)*(3·n+5)/720. A107908

Irregular triangle read by rows: T(n,k), 2 <= n , 3 <= k <= largest k such that A067175(k) <= n , is the smallest n-digit number m such that ω(m) = A001221(m) = k, and its largest prime factor equals the sum of its remaining prime factors. or -1 if no such number exists. A383677

Irregular triangle T(n,k), n >= 0, 0 <= k < 2^n-1, where T(n,k) = ∏_j=0..n-1 prime(n-j)^(j+1*d_j), where d_j is the bit with digit weight 2^j in the binary expansion of 2^n-1+k. A387465

a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = 1, a(2) = 3, and a(4) = 4. A49930

a(n) = A055993(n) - A034444(A056627(n)). A56630