Properties of the Number -101950

One Hundred One Thousand Nine Hundred Fifty

Basics

Value: -101951 → -101950 → -101949

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 ² × 2039

Divisors: 1, 2, 5, 10, 25, 50, 2039, 4078, 10195, 20390

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4938 Try Today's Challenge

Representations

Binary: -11000111000111110

Octal: -307076

Duodecimal: -4ABBA

Hexadecimal: -18e3e

Square: 10393802500

Square Root: 319.29610082179204

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

Array read by antidiagonals: T(n,m) is the number of n X m binary arrays with all 1's connected, and all corners 1. A389687

Number of n X n binary arrays with all 1s connected, and all corners 1. A163046

Number of n X 5 binary arrays with all 1s connected, and all corners 1. A163049

Triangle read by rows: T(n,k) = A(k,n-k), 1 <= k < n, 2 <= n, where A(m,n) is the number of distinct strings consisting of one X, 2·m Y's and 2·n Z's in which the X lies to the right of at least m Y's and at least n Z's. A351584

Triangle read by rows: T(n,k) = A(k,n-k), 1 <= k < n, 2 <= n, where A(m,n) is the number of distinct strings consisting of one X, m+n-1 Y's and m+n-1 Z's in which the X lies to the right of at least m Y's and at least m Z's. A351585