Properties of the Number 14058

Fourteen Thousand Fifty-Eight

Basics

Value: 14057 → 14058 → 14059

Parity: even

Prime: No

Previous Prime: 14057

Next Prime: 14071

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 11 × 71

Divisors: 1, 2, 3, 6, 9, 11, 18, 22, 33, 66

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011011101010

Octal: 33352

Duodecimal: 8176

Hexadecimal: 36ea

Square: 197627364

Square Root: 118.56643707221703

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

Expansion of g.f. (1 - 3·x + x² - sqrt(1 - 6·x + 7·x² - 2·x³ + x⁴))/(2·x). A78482

Number of partitions of n having no parts with multiplicity 3. A118807

G.f. A(x) satisfies A(x/A(x)⁴) = 1/(1-x). A145162

Total sum of the numbers of partitions with positive k-th ranks of all partitions of n. A208479

a(n) = ∏_{d∣n, d<n} prime(1+A003415(d)), where A003415(d) gives arithmetic derivative of d. A319356

Numbers that occur in range of A324580. A324541

a(n) = ∑_k=0..n f(k)*f(n-k) where f(k) = A002124(k). A2125

Triangle related to Bell numbers; T(n,k) read by rows, n>=0, 0<=k<=n: T(n,k) = k·T(n-1,k) + Sum(0<=j, T(n-1,k-1+j)); T(0,0)=1, T(0,k)=0 if k>0. A86211

Largest number k such that φ(k) = A007374(n). A224532

Number of partitions p of n such that (number of numbers in p of form 3k) = (number of numbers in p of form 3k+1). A241744