Properties of the Number 14297

Fourteen Thousand Two Hundred Ninety-Seven

Basics

Value: 14296 → 14297 → 14298

Parity: odd

Prime: No

Previous Prime: 14293

Next Prime: 14303

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 17 × 29 ²

Divisors: 1, 17, 29, 493, 841, 14297

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011111011001

Octal: 33731

Duodecimal: 8335

Hexadecimal: 37d9

Square: 204404209

Square Root: 119.57006314291216

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) = 17·n². A244630

T(n,k)=Majority value maps: number of nXk binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and antidiagonal neighbors in a random 0..3 nXk array. A221499

Sum of squares of first n positive integers congruent to 1 mod 3. A24215

Numbers p²*q, p > q odd primes such that q does not divide p-1, and q does not divide p+1. A350421

a(1) = 1, a(n) = n+a(n-1) if n does not divide a(n-1), else a(n) = n·a(n-1). A95234

Triangle read by rows giving the coefficients of general sum formulas of n-th Subfactorial numbers (A000166). The k-th row (k>=1) contains T(i,k) for i=1 to 2·k-1, where T(i,k) satisfies Subf(n) = ∑_k=1..n ∑_i=1..2·k-1 T(i,k) * C(n-k,i-1) * n^n-k. A101560

Write 0, 1, ..., n in base 3 and add as if they were decimal numbers. A121718

Number of nonempty subsets of {1, 2, ..., n} with <= 4 pairwise coprime elements. A187265

First row of spectral array W(e^γ). A250255

Nonsemiprimes in A306097 = A121707 \ A267999. A321488