Properties of the Number -10049

Ten Thousand Forty-Nine

Basics

Value: -10050 → -10049 → -10048

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 13 × 773

Divisors: 1, 13, 773, 10049

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10011101000001

Octal: -23501

Duodecimal: -5995

Hexadecimal: -2741

Square: 100982401

Square Root: 100.24470060806208

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

Number of partitions of n containing a clique of size 5. A183562

Number of squares on infinite chessboard at <= n knight's moves from a fixed square. A18836

Consecutive states of the linear congruential pseudo-random number generator for 16-bit WATFOR/WATFIV when started at 1. A384158

Number of self-conjugate three-quadrant Ferrers graphs that partition n. A59777

Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic nonresidues mod p that are > p/2. A282042

a(n) = 10·n² - 6·n + 1. A87348

Form the difference table of the sequence {2^k*k!}, then divide k-th column entries by 2^k*k!. Array read by ascending antidiagonals, T(n, k) for n, k >= 0. A143410

Number of unlabeled rooted trees with 2n nodes and maximal outdegree (branching factor) n. A244407

a(1) = 2; thereafter, if a(n-1) is prime then a(n) = prime(n) + 1; otherwise a(n) = 2·a(n-1) - 1. A373801

a(n) = floor( n*(n-1)*(n-2)/11 ). A11893