Properties of the Number 14570

Fourteen Thousand Five Hundred Seventy

Basics

Value: 14569 → 14570 → 14571

Parity: even

Prime: No

Previous Prime: 14563

Next Prime: 14591

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 × 31 × 47

Divisors: 1, 2, 5, 10, 31, 47, 62, 94, 155, 235

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100011101010

Octal: 34352

Duodecimal: 8522

Hexadecimal: 38ea

Square: 212284900

Square Root: 120.70625501605126

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

On a spirally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped, or -1 if it never gets trapped. A323469

Numbers k such that (2·k)!/(2*(k!)²)+1 is prime. A112863

a(n) = 2^n²+n * C(1/2ⁿ, n). A159478

Number of regions in a polygon whose boundary consists of n+2 equally spaced points around a semicircle and three equally spaced points along the diameter (a total of n+3 points). See Comments for precise definition. A333642

Number of 6 X 6 binary matrices with n=0...36 ones up to row and column permutations. A52370

Solution of the complementary equation a(n) = a(n-1) + 3·a(n-2) -2·a(n-3) - 2·a(n-4) + b(n-4), where a(0) = 1, a(1) = 2, a(2) = 3, a(3) = 4, b(0) = 5, b(1) = 6, b(2) = 7, b(3) = 8, and (a(n)) and (b(n)) are increasing complementary sequences. A295620

Triangle read by rows: T(m,n) (1 <= n < m) is the number of moves of an (m,n)-leaper (a generalization of a chess knight) until it can no longer move, starting on a board with squares spirally numbered from 1. Each move is to the lowest-numbered unvisited square. T(m,n) = -1 if the path never terminates. A323749

Triangle read by rows: T(n,k) is the number of embeddings on the sphere of 2-connected homeomorphically irreducible planar graphs with n nodes and k faces, k=4..2n-4. A378075

Floor of area of triangle with consecutive prime sides. A96377

Number of cubic equations ax³ + bx² + cx + d = 0 with integer coefficients |a|,|b|,|c|,|d| <= n, a <> 0, having three real roots, of which at least two are equal. A155192