Properties of the Number 15452

Fifteen Thousand Four Hundred Fifty-Two

Basics

Value: 15451 → 15452 → 15453

Parity: even

Prime: No

Previous Prime: 15451

Next Prime: 15461

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 3863

Divisors: 1, 2, 4, 3863, 7726, 15452

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11110001011100

Octal: 36134

Duodecimal: 8B38

Hexadecimal: 3c5c

Square: 238764304

Square Root: 124.30607386608267

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 ways to reciprocally link elements of an nXk array either to themselves or to exactly two horizontal, vertical or antidiagonal neighbors. A220688

a(0)=0; thereafter a(n) = A238824(n-1)+A238825(n). A238828

Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A384145. A384652

Number of 2 X 2 matrices having all elements in {-n,...n} and determinant 2. A209984

a(n) = floor((10·n³ + 63·n² + 126·n + 89) / 72). A254874

Number of perfect cube parts in all partitions of n. A264392

Triangle read by rows: number of Dyck paths of semilength n having k 3-bridges of a given shape (0<=k<=floor(n/3)). A 3-bridge is a subpath of the form UUUDDD or UUDUDD starting at level 0. A114499

Number of Dyck paths of semilength n having no UUUDDD's starting at level zero; here U=(1,1), D=(1,-1). Also number of Dyck paths of semilength n having no UUDUDD's starting at level zero. A114500

Triangle read by rows: T(n,k) is the number of Delannoy paths of length n, having k EE's and NN's crossing the line y = x (i.e., two consecutive E steps from the line y = x+1 to the line y = x-1 or two consecutive N steps from the line y = x-1 to the line y = x+1). A110123

Number of ways to reciprocally link elements of an nX4 array either to themselves or to exactly two horizontal, vertical or antidiagonal neighbors. A220684