Properties of the Number -103049

One Hundred Three Thousand Forty-Nine

Basics

Value: -103050 → -103049 → -103048

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 103049

Divisors: 1, 103049

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001001010001001

Octal: -311211

Duodecimal: -4B775

Hexadecimal: -19289

Square: 10619096401

Square Root: 321.01246081733336

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

Signed super-Catalan or little Schroeder numbers. A80243

Schroeder's second problem (generalized parentheses); also called super-Catalan numbers or little Schroeder numbers. A1003

Smaller of two consecutive primes whose sum is a square. A61275

Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x. A11117

Least prime in A031936 (lesser of 18-twins) whose distance to the next 18-twin is 2·n. A52358

Triangle read by rows: T(n,k) is number of Schroeder paths of length 2n and having k peaks at height 1, for 0 <= k <= n. A104219

Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = (-1)ⁿ * ∑_j=0..n (-2)^j * binomial(n,j) * binomial(k·n+j+1,n)/(k·n+j+1). A336573

Lesser of consecutive primes whose sum is a perfect power (A001597). A91624

Triangular array formed by the little Schröder numbers s(n,k). A110440

Riordan array (s(x),x·S(x)) where s(x) is the g.f. of the little Schroeder numbers A001003, and S(x) is the g.f. of the large Schroeder numbers A006318. A186826