Properties of the Number 14056

Fourteen Thousand Fifty-Six

Basics

Value: 14055 → 14056 → 14057

Parity: even

Prime: No

Previous Prime: 14051

Next Prime: 14057

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 7 × 251

Divisors: 1, 2, 4, 7, 8, 14, 28, 56, 251, 502

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11011011101000

Octal: 33350

Duodecimal: 8174

Hexadecimal: 36e8

Square: 197571136

Square Root: 118.55800268223145

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

a(n) = 2^n-1 + 2^[ n/2 ] + 2^[ (n-1)/2 ] - F(n+3). A5674

Fundamental discriminants d uniquely characterizing all complex biquadratic fields Q(sqrt(-3),sqrt(d)) which have 3-class group of type (3,3) and second 3-class group isomorphic to either SmallGroup(2187,247)-#1;5 or SmallGroup(2187,247)-#1;9. A250242

The number of non-equivalent distinguishing colorings of the cycle on n vertices with at most k colors (k>=1). The cycle graph is defined for n>=3; extended to n=1,2 using the closed form. Square array read by descending antidiagonals: the rows are indexed by n, the number of vertices of the cycle and the columns are indexed by k, the number of permissible colors. A309528

Triangle read by rows where T(n,k) is the number of labeled simple graphs covering n vertices with exactly k endpoints (vertices of degree 1). A327377

Numbers k such that the odd part of σ(σ(k)) is equal to the odd part of σ(k). A353365

Number of identity bracelets of n beads of 4 colors. A32241

T(n,k) = Number of n X k 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X (k+1) binary array having two adjacent 1's and two adjacent 0's. A227442

Numbers m such that m*(m-τ(m))/σ(m) is an integer h where k-τ(k) is the number of nondivisors of k (A049820) and σ(k) is the sum of the divisors of k (A000203). A325020

Number of permutations σ of [n] such that σ(k)/k > σ(k+1)/(k+1) for 1 <= k <= n-1. A309807

a(n) = 2·n*(9·n-1). A178574