ℕ atory
Play Now

Properties of the Number 13930

Thirteen Thousand Nine Hundred Thirty

Basics

Value: 13929 → 13930 → 13931

Parity: even

Prime: No

Previous Prime: 13921

Next Prime: 13931

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 × 5 × 7 × 199

Divisors: 1, 2, 5, 7, 10, 14, 35, 70, 199, 398

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011001101010

Octal: 33152

Duodecimal: 808A

Hexadecimal: 366a

Square: 194044900

Square Root: 118.02542099056457

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

Weird numbers: abundant (A005101) but not pseudoperfect (A005835). A6037
Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with all 1's connected, a path of 1's from top row to lower right corner, and no 1 having more than two 1's adjacent. A391823
Unitary weird numbers: unitary abundant (A034683) but not unitary pseudoperfect (A293188). A64114
Bi-unitary weird numbers: bi-unitary abundant numbers (A292982) that are not bi-unitary pseudoperfect (A292985). A292986
Infinitary weird numbers: infinitary abundant numbers (A129656) that are not infinitary pseudoperfect numbers (A306983). A306984
Triangle read by rows: T(n,k) is the number of permutations of [n] with exactly k increasing runs of odd length. A97591
Triangle read by rows: T(n,k) is the number of acyclic digraphs on n unlabeled nodes with k arcs and a global source and sink, n >= 1, k = 0..n*(n-1)/2. A350491
Number of configurations of the sliding block 8-puzzle that require a minimum of n moves to be reached, starting with the empty square at mid-side. A89483
Nonexponential weird numbers: nonexponential abundant numbers (A348604) that are not equal to the sum of any subset of their nonexponential divisors. A348631
Number of n X 5 binary arrays with all 1s connected, a path of 1s from top row to lower right corner, and no 1 having more than two 1s adjacent. A163698