Properties of the Number -10850

Ten Thousand Eight Hundred Fifty

Basics

Value: -10851 → -10850 → -10849

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 ² × 7 × 31

Divisors: 1, 2, 5, 7, 10, 14, 25, 31, 35, 50

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -10101001100010

Octal: -25142

Duodecimal: -6342

Hexadecimal: -2a62

Square: 117722500

Square Root: 104.1633332799983

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

The bottom entry in the forward difference table of the Euler totient function φ for 1..n. A331573

10-gonal (or decagonal) pyramidal numbers: a(n) = n*(n + 1)*(8·n - 5)/6. A7585

Triangle read by columns: number of n-node (unlabeled) connected graphs with girth k, for n >= 3, k >= 3. A128042

Number of partitions of n into 3 or more distinct parts. A347548

Numbers k such that the sum of the squares of the divisors of k is divisible by k. A46762

-10-Knödel numbers. A225514

Sums of the antidiagonals of Sundaram's sieve (A159919). A159920

T(n,k)=Number of nXk 0..1 arrays with every element unequal to 1, 2, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero. A316757

Triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n edges and k vertices, n >= 0, 1 <= k <= n+1. A331437

Number of n-node (unlabeled) connected graphs with girth 3. A128240