ℕ atory
Play Now

Properties of the Number -49440

Forty-Nine Thousand Four Hundred Forty

Basics

Value: -49441 → -49440 → -49439

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 5 × 3 × 5 × 103

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8109 Try Today's Challenge

Representations

Binary: -1100000100100000

Octal: -140440

Duodecimal: -24740

Hexadecimal: -c120

Square: 2444313600

Square Root: 222.35107375499675

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

Expansion of log(1+tan(x))*cosh(x). A9370
Result of using the positive integers 1,2,3,... as coefficients in an infinite polynomial series in·and then expressing this series as ∏k>=1 (1+a(k)xk). A147654
Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) is the constant term in the expansion of ( (∑j=0..n x2·j+1+1/x2·j+1) * (∑j=0..n y2·j+1+1/y2·j+1) - (∑j=0..n-1 x2·j+1+1/x2·j+1) * (∑j=0..n-1 y2·j+1+1/y2·j+1) )2·k. A329066
a(n) = ∑k=3..n binomial(k,3) * floor(n/k). A366971
Constant term in the expansion of ((x3 + x + 1/x + 1/x3)*(y3 + y + 1/y + 1/y3) - (x + 1/x)*(y + 1/y))2·n. A329024
Number of 3-step king's tours on an n X n board summed over all starting positions. A186862
Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(n,k) is the number of k-step closed paths (from origin to origin) in 2-dimensional lattice, using steps (t1,t2) (|t1| + |t2| = n). A329078
Number of 0..n arrays x(0..6) of 7 elements with zero 4th differences. A200274
Number of (2+2) X (n+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 3 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 3 6 or 7. A252534
a(n) is the number of graceful graphs with n edges and round(sqrt(3n+9/4)) vertices. A343296