Properties of the Number 15232

Fifteen Thousand Two Hundred Thirty-Two

Basics

Value: 15231 → 15232 → 15233

Parity: even

Prime: No

Previous Prime: 15227

Next Prime: 15233

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁷ × 7 × 17

Divisors: 1, 2, 4, 7, 8, 14, 16, 17, 28, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101110000000

Octal: 35600

Duodecimal: 8994

Hexadecimal: 3b80

Square: 232013824

Square Root: 123.4179889643321

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

Intermediate edge b of smallest (measured by the longest edge) primitive Euler bricks (a, b, c, sqrt(a² + b²), sqrt(b² + c²), sqrt(a² + c²) are integers). A31174

Expansion of e.g.f. 1 / (1 - x·cos(x)). A352252

Number of possible queen moves on an n X n chessboard. A35005

Numbers with prime signature {7,1,1}, i.e., of form p⁷*q·r with p, q and r distinct primes. A179696

Xfactorials - like factorials but use carryless GF(2)[ X ] polynomial multiplication. A48631

Coefficients of a special case of Poisson-Charlier polynomials. Triangle read by rows, T(n, k) for 0 <= k <= n. A137346

T(n,k)=Number of nXk 0..2 arrays with each sum of a(1..i,1..j) no greater than i·j. A183419

Least number·such that xⁿ has n digits equal to k. Case k = 7. A285454

G.f. satisfies A(x) = sqrt( (1 + 2·x*A(x)) / (1 - 2·x*A(x)) ). A138020

Triangle of coefficients of polynomials u(n,x) jointly generated with A208748; see the Formula section. A208747