Properties of the Number 13574

Thirteen Thousand Five Hundred Seventy-Four

Basics

Value: 13573 → 13574 → 13575

Parity: even

Prime: No

Previous Prime: 13567

Next Prime: 13577

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 × 11 × 617

Divisors: 1, 2, 11, 22, 617, 1234, 6787, 13574

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11010100000110

Octal: 32406

Duodecimal: 7A32

Hexadecimal: 3506

Square: 184253476

Square Root: 116.50751048752178

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

Let f(k) = exp(π*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10³. A127022

Expansion of (1/x) * Series_Reversion( x * (1-x³/(1-x))² ). A369011

Walks of length n on the x-axis using steps {1,0,-1} and visiting no point more than twice. A212587

Number of ways to split 1, 2, 3, ..., 6n into n arithmetic progressions each with 6 terms. A104432

Diagonal sum of left-justified array T given by A027023. A27037

Number of 3-unbalanced strings of length n (= 2ⁿ - A027557(n)). A27558

Triangle read by rows: T(n,k) is the number of hill-free Dyck paths of semilength n and having k valleys strictly above the x-axis (0<=k<=n-2; n>=2). A hill in a Dyck path is a peak at level 1. A119011

Sphenic numbers k such that none of k-2, k-1, k+1 and k+2 is squarefree. A362561

a(n) = 4·n³ + 5·n - 1. A383854

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 1, -1), (0, 1, 1), (1, 0, -1), (1, 1, 1)}. A150938