Properties of the Number 14064

Fourteen Thousand Sixty-Four

Basics

Value: 14063 → 14064 → 14065

Parity: even

Prime: No

Previous Prime: 14057

Next Prime: 14071

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁴ × 3 × 293

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 48

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

603 Try Today's Challenge

Representations

Binary: 11011011110000

Octal: 33360

Duodecimal: 8180

Hexadecimal: 36f0

Square: 197796096

Square Root: 118.59173664298875

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 triangle related to the a(n) formulas of the rows of the ED1 array A167546. A167552

Irregular triangle read by rows: T(n, k) = number of ways to tile an n X n X n triangular area with k 2 X 2 X 2 triangular tiles and an appropriate number (= n²-4·k) of 1 X 1 X 1 tiles. A286436

Number of ways to tile an n X n X n triangular area with five 2 X 2 X 2 triangular tiles and an appropriate number (= n²-20) of 1 X 1 X 1 tiles. A286440

Number of partitions p of n such that floor(mean(p)) and ceiling(mean(p)) are parts of p. A241340

Values of k such that k² + 9 is a triangular number (A000217). A276601

Triangle T(n, k, m) = coefficients of p(x, n, m) where p(x,n,m) = (x+1)*p(x, n-1, m) + (2^m+n-1 + 2^n-2*[n>=3])*x·p(x, n-2, m) and m=1, read by rows. A154985

Expansion of ∏_k>=1 1/(1 - (5·k-4)*x^5·k-4). A265834

Decimal part of n-th root of a(n) starts with digit 7. A34084

A060448 sorted and duplicates removed. A60636

Least number k such that 2·k*n + 1 is a prime dividing 3ⁿ + 1. A189240