Properties of the Number 33642

Thirty-Three Thousand Six Hundred Forty-Two

Basics

Value: 33641 → 33642 → 33643

Parity: even

Prime: No

Previous Prime: 33641

Next Prime: 33647

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 × 3 ³ × 7 × 89

Divisors: 1, 2, 3, 6, 7, 9, 14, 18, 21, 27

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1000001101101010

Octal: 101552

Duodecimal: 17576

Hexadecimal: 836a

Square: 1131784164

Square Root: 183.41755641159327

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

Total number of parts in all partitions of n into odd parts. A67588

This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,6). The p-th row (p>=1) contains a(i,p) for i=1 to 6·p-5, where a(i,p) satisfies ∑_i=1..n C(i+5,6)^p = 7·C(n+6,7) * ∑_i=1..6·p-5 a(i,p) * C(n-1,i-1)/(i+6). A87110

Ratio from A049102. A49106

Total number of inversions in all partitions of n. A271370

Numbers k such that there are 10 digits in k² and for each factor f of 10 (1, 2, 5) the sum of digit groupings of size f is a square. A153748

a(0) = 1, a(n) = 40·n² + 2 for n>0. A10022

The A161671(n)-th partial sum of A161671. A161778

Dispersion of (2·floor(n·sqrt(3))), by antidiagonals. A191542

Irregular triangle read by rows. Row n gives the coefficients of the polynomial multiplying the exponential function in the e.g.f. of the (n+1)-th diagonal sequences of triangle A008459 (Pascal squares). T(n,k) for n >= 0 and k = 0..2·n. A290310

Base 5 digital convolution sequence. A33642