Properties of the Number -49700

Forty-Nine Thousand Seven Hundred

Basics

Value: -49701 → -49700 → -49699

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 ² × 7 × 71

Divisors: 1, 2, 4, 5, 7, 10, 14, 20, 25, 28

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -1100001000100100

Octal: -141044

Duodecimal: -24918

Hexadecimal: -c224

Square: 2470090000

Square Root: 222.93496809607953

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

McKay-Thompson series of class 8D for the Monster group. A112143

McKay-Thompson series of class 16c for the Monster group. A112152

McKay-Thompson series of class 8E for the Monster group. A29841

Let f(z) = z² + c, then row k lists the expansion of the n-fold composition f(f(...f(0)...)) in rising powers of c. A137560

Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns. A335920

E.g.f. S(x) satisfies: C(x)² - S(x)² = 1 and D(x)³ - S(x)³ = 1, where functions C(x) and D(x) are described by A280621 and A280622, respectively. A280620

Number of binary search trees (BST) on n nodes which have the same height as the optimal BST. A328349

Triangle by rows, related to the numbers of binary trees of height less than n, derived from the Mandelbrot set. A202019

McKay-Thompson series of class 16b for the Monster group. A112151

Number of standard Young tableaux with n cells and 4 as last value in the first row. A245002