Properties of the Number 13958

Thirteen Thousand Nine Hundred Fifty-Eight

Basics

Value: 13957 → 13958 → 13959

Parity: even

Prime: No

Previous Prime: 13933

Next Prime: 13963

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 2 × 7 × 997

Divisors: 1, 2, 7, 14, 997, 1994, 6979, 13958

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011010000110

Octal: 33206

Duodecimal: 80B2

Hexadecimal: 3686

Square: 194825764

Square Root: 118.14397995666135

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

Except a(0)=1 and a(4)=0, number of integer partitions of n with no 1's and at least two parts. A379720

Number of partitions of n into >= 2 parts and with minimum part >= 2. A83751

Number of integer partitions of n where 2*(number of distinct parts) >= (number of parts). A361394

Numbers that are the sum of nine fourth powers in exactly nine ways. A345851

Let (u1,u2) be successive untouchable numbers such that φ(u1) = φ(u2); sequence gives values of u1. A48189

Irregular triangle read by rows: T(n, k) is the number of chains of subspaces 0 < V₁ < ... < V_r = (F₂)ⁿ, counted up to coordinate permutation, with dimension increments given by (any fixed permutation of) the parts of the k-th partition of n in Abramowitz-Stegun order. A348113

Total number of ways of partitioning n and any natural number less than or equal to n into the same number of parts, treating partitions of n and itself in a different order as distinct. A380125

Sum over all partitions λ of n into 3 distinct parts of ∏_i:λ prime(i). A258358

Number of (n+2)X(5+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally. A254904

Number of length n+6 0..1 arrays with at most one downstep in every n consecutive neighbor pairs. A255997