Properties of the Number 15352

Fifteen Thousand Three Hundred Fifty-Two

Basics

Value: 15351 → 15352 → 15353

Parity: even

Prime: No

Previous Prime: 15349

Next Prime: 15359

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 19 × 101

Divisors: 1, 2, 4, 8, 19, 38, 76, 101, 152, 202

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101111111000

Octal: 35770

Duodecimal: 8A74

Hexadecimal: 3bf8

Square: 235683904

Square Root: 123.90318801386832

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

L.g.f.: log( ∑_n>=0 x^n² ), the log of the characteristic function of the squares. A162552

Centered 17-gonal numbers: (17·n² - 17·n + 2)/2. A69130

T(n,k)=Number of nXk 0..1 arrays with each 1 horizontally or vertically adjacent to 1, 3 or 4 1s. A295551

Array read by antidiagonals: T(n,m) is the number of maximal matchings in the rook graph K_n X K_m. A341847

Number of maximal matchings in the 2 X n rook graph. A281433

Expansion of (1/(1 - x))*∏_k>=1 1/(1 - k·x^k). A302830

Numbers k such that x=(σ(k) XOR 2·k) divides k in carryless binary arithmetic, when the binary expansions of k and·are interpreted as polynomials in ring GF(2)[X]. A379236

a(n) = 49n² - 28n - 20. A118058

a(n) = 14·a(n-1) - 44·a(n-2) for n > 1; a(0) = 2, a(1) = 19. A163067

a(n) = ∑_k>=1 H_n(k-1)/2^k, where H_n(x) is n-th Hermite polynomial. A277380