Properties of the Number 14022

Fourteen Thousand Twenty-Two

Basics

Value: 14021 → 14022 → 14023

Parity: even

Prime: No

Previous Prime: 14011

Next Prime: 14029

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ² × 19 × 41

Divisors: 1, 2, 3, 6, 9, 18, 19, 38, 41, 57

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11011011000110

Octal: 33306

Duodecimal: 8146

Hexadecimal: 36c6

Square: 196616484

Square Root: 118.4145261359433

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

Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3·T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1) for k >= 1. A126954

a(n) = ∑_{k=0..floor(n/2)} A026626(n, k). A26634

T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. A302322

Numbers k such that the odd part of σ(σ(k)) is equal to the odd part of σ(k). A353365

Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed. A228963

Least number k such that the determinant of the circulant matrix formed by its decimal digits is equal to k/n. A323485

a(n) = n*(17·n - 13)/2. A180232

Number of integer-sided polygons having perimeter n, modulo rotations and reflections. A293818

Number of prime parts, counted without multiplicity, in all compositions of n. A336632

Möbius transform of A341529, σ(n) * A003961(n). A347125