Properties of the Number -104960

One Hundred Four Thousand Nine Hundred Sixty

Basics

Value: -104961 → -104960 → -104959

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ⁹ × 5 × 41

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 32, 40

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -11001101000000000

Octal: -315000

Duodecimal: -508A8

Hexadecimal: -19a00

Square: 11016601600

Square Root: 323.9753077010654

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

The Franel number a(n) = ∑_{k = 0..n} binomial(n,k)³. A172

Square array A(n, k) = ∑_j=0..n binomial(n,j)^k, n >= 0, k >= 0, read by antidiagonals. A309010

Square array A(n,k) = (n!)³ [xⁿ] hypergeom([], [1, 1], z)^k read by antidiagonals. A287698

Array read by antidiagonals: Solutions to Schmidt's Problem. A94424

Expansion of 1/(1-2·x²-4·x³). (2,4)-Padovan sequence. A176739

Composite numbers m such that ∏_i=1..k (p_i/(p_i-1)) / ∑_i=1..k (p_i/(p_i+1)) is an integer, where p_i are the k prime factors of m (with multiplicity). A230112

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = ∑_j=0..n k^j * binomial(n,j)³. A336163

Main diagonal of the square array A058395. A362179

Inverse modulo 2 binomial transform of 3ⁿ. A100736

Expansion of 1/sqrt(1-4·x-12·x²+48·x³). A106185