Properties of the Number 30952

Thirty Thousand Nine Hundred Fifty-Two

Basics

Value: 30951 → 30952 → 30953

Parity: even

Prime: No

Previous Prime: 30949

Next Prime: 30971

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 53 × 73

Divisors: 1, 2, 4, 8, 53, 73, 106, 146, 212, 292

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100011101000

Octal: 74350

Duodecimal: 15AB4

Hexadecimal: 78e8

Square: 958026304

Square Root: 175.93180496999398

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 such that 2*(least part) < greatest part. A237820

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250592

Third row of Pascal-(1,2,1) array A081577. A81583

E.g.f. satisfies: A'(x) = 1 + A(x)*exp(A(x)). A235129

Number of parts in all partitions of n with largest multiplicity ten. A320380

a(n) = n! [xⁿ] exp((1/(x - 1)² - 1)/2)/(1 - x). A321965

Numbers k such that φ(k) + 9 | σ(k). A15800

Least k such that ∑_r=n+1..k r >= n!. A93000

Number of (n+1) X (1+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250585

Number of (n+1)X(6+1) 0..2 arrays with nondecreasing max(x(i,j),x(i,j-1)) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction. A250590