Properties of the Number 9878

Nine Thousand Eight Hundred Seventy-Eight

Basics

Value: 9877 → 9878 → 9879

Parity: even

Prime: No

Previous Prime: 9871

Next Prime: 9883

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 2 × 11 × 449

Divisors: 1, 2, 11, 22, 449, 898, 4939, 9878

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10011010010110

Octal: 23226

Duodecimal: 5872

Hexadecimal: 2696

Square: 97574884

Square Root: 99.38812806366765

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

Magic numbers: atoms with full shells containing any of these numbers of electrons are considered electronically stable. A18227

Sum of digits = 8 times number of digits. A61425

Column 4 of an array closely related to A083480. (Both arrays have shape sequence A083479). A89574

Sum of the lengths of the second ascents in all Dyck paths of semilength n+2. A114277

Sphenic numbers (A007304) whose neighbors are sphenic. A248202

Number of n X 3 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order. A166830

Triangle (read by rows) formed by setting all entries in the first column and in the main diagonal ((i,i) entries) to 1 and the rest of the entries by the recursion T(n, k) = T(n-1, k) + T(n, k-1). A96465

Expansion of 2*(2·x+1)/((x+1)*(sqrt(4·x+1)+1)). A104496

Triangle read by rows: T(n,k) is the number of permutations of n elements with k the (smallest) header (first element) of the longest descending subsequence. A224652

Irregular triangular array read by rows: T(n,k) = number of non-isomorphic unlabeled connected graphs with loops on n nodes and with k edges. A283755