Properties of the Number 14311

Fourteen Thousand Three Hundred Eleven

Basics

Value: 14310 → 14311 → 14312

Parity: odd

Prime: No

Previous Prime: 14303

Next Prime: 14321

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 11 × 1301

Divisors: 1, 11, 1301, 14311

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011111100111

Octal: 33747

Duodecimal: 8347

Hexadecimal: 37e7

Square: 204804721

Square Root: 119.62859190009719

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

Associated Mersenne numbers. A1351

Least k such that k·10ⁿ+1, k·10ⁿ+3, k·10ⁿ+7 and k·10ⁿ+9 are all prime. A64281

Nonprime numbers with all divisors starting and ending with digit 1. A208261

Ulam's spiral (NNE spoke). A143861

Composite numbers k with its divisors having the property that the last digit of every divisor is the same as the first digit of the next divisor. A307858

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

a(n) = floor(5·prime(n)² / 4). A246010

Number of length-4 0..n arrays with no repeated value unequal to the previous repeated value plus one mod n+1. A268945

The number of closed λ calculus terms of size n that have a normal form, where size(λ M)=2+size(M), size(M N)=2+size(M)+size(N), and size(V)=1+i for a variable V bound by the i-th enclosing λ. A333958

a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A000201 (lower Wythoff sequence). A24863