Properties of the Number -10173

Ten Thousand One Hundred Seventy-Three

Basics

Value: -10174 → -10173 → -10172

Parity: odd

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 3391

Divisors: 1, 3, 3391, 10173

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -10011110111101

Octal: -23675

Duodecimal: -5A79

Hexadecimal: -27bd

Square: 103489929

Square Root: 100.86129089001389

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 integer partitions of n where some part is the difference of two consecutive parts. A364467

a(n) = smallest k such that the Reverse and Add! trajectory of A063048(n) joins the trajectory of k. A89493

Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k U H^j Us for some j>0, where U=(1,1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology). A97777

Numbers m such that A166133(m+1) = A166133(m)² - 1. A256703

x-value of the smallest solution to 2·x² - p·y² = (-1)^(p+1/4), p = A002145(n). A306618

Lucky numbers with size of gaps equal to 20 (upper terms). A31903

a(n) = ∑_i=1...n ∑_j=1..i lcm(i,j)/i. A232533

Number of Dyck paths of semilength n such that the maximal number of peaks per level equals four. A288745

Total height of all symmetrically unique Dyck paths of semilength n. A291886

Triangle T(n,k) read by rows: number of simple connected graphs with n nodes and k endpoints, n >= 0, 0 <= k <= n. A304222