Properties of the Number 39902

Thirty-Nine Thousand Nine Hundred Two

Basics

Value: 39901 → 39902 → 39903

Parity: even

Prime: No

Previous Prime: 39901

Next Prime: 39929

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 × 71 × 281

Divisors: 1, 2, 71, 142, 281, 562, 19951, 39902

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001101111011110

Octal: 115736

Duodecimal: 1B112

Hexadecimal: 9bde

Square: 1592169604

Square Root: 199.75484975339148

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

Leading term of Stirling's approximation to n!, sqrt(2*π)*n^n+(1/2)/eⁿ, rounded to nearest integer. A5394

Leading term of Stirling's approximation to n!, sqrt(2*π)*n^n+(1/2)/eⁿ, rounded down. A5393

Expansion of ψ(x²) * φ(x⁷) / (f(-x) * f(-x⁷)) in powers of·where φ(), ψ(), f() are Ramanujan θ functions. A193826

Numbers m such that abs(K(m+1) - K(m)) = 2, and both m and m+1 are squarefree (A005117), where K(m) = A002034(m) is the Kempner function. A346212

a(n) is the constant term in expansion of ∏_k=1..n (x^prime(k) + 1/x^prime(k))². A350881

Number of permutations of 1..n with the sum of squared adjacent differences < n*(n-1)/2. A180069

Number of nondecreasing arrangements of n+2 numbers in 0..4 with each number being the sum mod 5 of two others. A183907

a(n) = floor(n^3/2)*floor(3+n^3/2)/2. A185593

Number of partitions satisfying 0 < cn(1,5) + cn(4,5) + cn(2,5) and 0 < cn(1,5) + cn(4,5) + cn(3,5). A39902