Properties of the Number 63240

Sixty-Three Thousand Two Hundred Forty

Basics

Value: 63239 → 63240 → 63241

Parity: even

Prime: No

Previous Prime: 63211

Next Prime: 63241

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 5 × 17 × 31

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1111011100001000

Octal: 173410

Duodecimal: 30720

Hexadecimal: f708

Square: 3999297600

Square Root: 251.4756449439985

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

Number of partitions of n in which number of parts is not 2. A58984

Expansion of ∏_n>=1 (1 - x^5·n)³⁰/(1 - xⁿ)³¹ in powers of x. A278558

Coefficient of x⁴ in (1-x-x²)^-n. A6504

Number of integer partitions of n that are not of length 2 and do not contain n/2. A365825

Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,57. A65697

G.f. A(x) satisfies A(x) = (1 + x·A(x)³) / (1 - 2·x). A348793

Triangle of coefficients of polynomials v(n,x) jointly generated with A210860; see the Formula section. A210861

Numbers whose number of divisors equals the sum of their separate prime-power decompositions. A87004

Numbers m such that product of factorials of digits of m equals σ(m). A137603

a(n) is the least k that is a multiple of A071395(n) (the n-th primitive abundant number) for which A003961(k) is abundant. A337469