Properties of the Number 14030

Fourteen Thousand Thirty

Basics

Value: 14029 → 14030 → 14031

Parity: even

Prime: No

Previous Prime: 14029

Next Prime: 14033

Digit Sum: 8

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 23 × 61

Divisors: 1, 2, 5, 10, 23, 46, 61, 115, 122, 230

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 11011011001110

Octal: 33316

Duodecimal: 8152

Hexadecimal: 36ce

Square: 196840900

Square Root: 118.4483009586883

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

T(n,k)=Number of n X n 0..k matrices whose square is also a 0..k matrix. A213990

T(n,k)=Number of length-(n+1) 0..k arrays with new values introduced in sequential order, and with new repeated values introduced in sequential order, both starting with zero. A268327

Euler-Seidel matrix T(k,n) with start sequence A000248, read by antidiagonals. A98697

5 times centered pentagonal numbers: 5*(5·n² + 5·n + 2)/2. A164015

Number of n-node rooted trees in which three equals the maximal number of nodes in paths starting at a leaf and ending at the first branching node or at the root. A318899

G.f. A(x) = x·F'(x)/F(x) where F(x) is the g.f. of A381353 that satisfies [xⁿ] F(x)^prime(n) = 0 for n > 1. A381355

Fibonacci sequence beginning 0, 23. A22357

a(n) = floor(sqrt(φ(w)*σ(w)+w²)), where w=10ⁿ. A65550

Number of 3-step one space leftwards or up, two space rightwards or down asymmetric rook's tours on an n X n board summed over all starting positions. A187298

Number of 3X3 0..n matrices whose square is also a 0..n matrix. A213992