Properties of the Number -199140

One Hundred Ninety-Nine Thousand One Hundred Forty

Basics

Value: -199141 → -199140 → -199139

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 ² × 3 × 5 × 3319

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -110000100111100100

Octal: -604744

Duodecimal: -972B0

Hexadecimal: -309e4

Square: 39656739600

Square Root: 446.2510504189318

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 paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have no peaks of the form ud. A108447

a(n) = ∑_k=0..10 binomial(n,k). A8863

a(n) = 2ⁿ - C(n,0) - C(n,1) - ... - C(n,7). A35040

Triangle, read by rows, where diagonals are successive self-convolutions of A108447. A118343

a(n) = number of subsets of {1,2,...,n} that contain more nonprimes than primes. A369853

Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1), U=(1,2), or d=(1,-1) and have k peaks of the form ud. A108446

Number of n X 3 nonnegative integer arrays with upper left 0 and lower right its king-move distance away minus 3 and every value increasing by 0 or 1 with every step right, diagonally se or down. A253006

a(n) = ∑_i=0..n+1 binomial(2·n,n-i+1). A277924