Properties of the Number 14024

Fourteen Thousand Twenty-Four

Basics

Value: 14023 → 14024 → 14025

Parity: even

Prime: No

Previous Prime: 14011

Next Prime: 14029

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 ³ × 1753

Divisors: 1, 2, 4, 8, 1753, 3506, 7012, 14024

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 11011011001000

Octal: 33310

Duodecimal: 8148

Hexadecimal: 36c8

Square: 196672576

Square Root: 118.4229707446997

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

Palindromic numbers in bases 3 and 9 written in base 10. A259386

Number of compositions of n into 4 ordered relatively prime parts. A742

Number of decagons that can be formed with perimeter n. A288256

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 4 6 or 7. A252269

T(n,k)=Number of n-step one or two space at a time bishop's tours on a kXk board summed over all starting positions. A187046

A014486-codes for the compact representation of Beanstalk-tree, growing by two natural numbers at time, starting from the tree of one internal node (1) and two leaves (3 and 2), with the larger numbers coming to the left hand side. A218782

Number of self-avoiding polygons with perimeter n and sides = 1 that have vertex angles from the set 0, +-π/6, +-*π/3, +-π/2, +-2*π/3, +-5*π/6, not counting rotations and reflections as distinct. A316192

Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n, having k return steps to the line y = x from the line y = x+1 or from the line y = x-1 (i.e., E steps from the line y = x+1 to the line y = x or N steps from the line y = x-1 to the line y = x). A110107

Triangle T(n, k, q) = (1-qⁿ)*( binomial(n, k) - 1 ) + 1, with q = 2, read by rows. A174718

a(n) = number of subsets S of {1,2,...,n} having more than 2 elements such that (sum of least three elements of S) = max(S). A357287