Properties of the Number 14059

Fourteen Thousand Fifty-Nine

Basics

Value: 14058 → 14059 → 14060

Parity: odd

Prime: No

Previous Prime: 14057

Next Prime: 14071

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 17 × 827

Divisors: 1, 17, 827, 14059

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011011101011

Octal: 33353

Duodecimal: 8177

Hexadecimal: 36eb

Square: 197655481

Square Root: 118.57065404222075

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

Numbers k such that the smoothly undulating palindromic number (4·10^k-7)/33 = 121...21 is a prime (or PRP). A62209

Decimal value of the bitmap of active segments in 7-segment display of the number n, variant 1: bits 0-6 refer to segments from top to bottom, left to right. A234691

27-gonal numbers: a(n) = n*(25·n-23)/2. A255186

Integers i > 1 for which there is no prime p such that i is a solution mod p of x⁴ = 2. A65903

a(n) = ∑_k=1..n binomial(floor(n/k)+2,3). A364970

a(n) = smallest semiprime s such that s + n is the next semiprime and there is no prime between s and s + n. A133478

(A178476(n)-3)/9. A178486

a(n) = C(n+2,3) + 2·C(n,2) + 2*(n-2). A34857

The number of trees with 5 nodes labeled by positive integers, where each tree's label sum is n. A301740

a(n) is the least m such that A341284(m) = 2·n*prime(m+1) - prime(m). A342027