Properties of the Number -98610

Ninety-Eight Thousand Six Hundred Ten

Basics

Value: -98611 → -98610 → -98609

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 2 × 3 × 5 × 19 × 173

Divisors: 1, 2, 3, 5, 6, 10, 15, 19, 30, 38

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11000000100110010

Octal: -300462

Duodecimal: -49096

Hexadecimal: -18132

Square: 9723932100

Square Root: 314.0222922023212

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

Values of n such that n^a-+a are primes, a=7. A155022

Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,1)-steps. L_n is the set of lattice paths of weight n that start at (0,0) and end on the horizontal axis and whose steps are of the following four kinds: a (1,0)-step with weight 1; a (1,0)-step with weight 2; a (1,1)-step with weight 2; a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A182880

Number of (5+1) X (n+1) 0..1 arrays with every 2 X 2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically. A258558

Triangle read by rows: T(n,k) is the number of paths in the right half-plane, from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)). A132886

a(n) = (A051894(n) - 1)/2. A361152