Properties of the Number 69952

Sixty-Nine Thousand Nine Hundred Fifty-Two

Basics

Value: 69951 → 69952 → 69953

Parity: even

Prime: No

Previous Prime: 69941

Next Prime: 69959

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 ⁶ × 1093

Divisors: 1, 2, 4, 8, 16, 32, 64, 1093, 2186, 4372

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10001000101000000

Octal: 210500

Duodecimal: 34594

Hexadecimal: 11140

Square: 4893282304

Square Root: 264.48440407706465

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

Expansion of 1/((1-2·x)*(1-6·x)). A16129

Triangle of Legendre-Stirling numbers of the second kind T(n,j), n >= 1, 1 <= j <= n, read by rows. A71951

Numerator of ratio n*σ(A003961(n)) / σ(n)*A003961(n), where σ is the sum of divisors of n, and A003961 shifts the prime factorization of n one step towards larger primes. A341526

Triangle of scaled second column sequences of (k,k)-Stirling2 arrays. A91039

a(n) = 2·a(n-1) - a(n-3) + a(ceiling(n/2)), where a(0) = 1, a(1) = 1, a(2) = 1. A298404

a(n) = p(1,n), where p(x,n) is the strong divisibility sequence of polynomials based on sqrt(3) as in A327321. A329009

a(n) = ∑_{-n<i<n, -n<j<n, gcd{i,j}=2} (n-|i|)*(n-|j|). A331772

a(1)=1; for n > 1, a(n) = ∑_{1<=j<n, gcd(j,n)=1} a(j)*a(n-j). A96421

Triangle read by rows of Legendre-Stirling numbers of the second kind. A191935

Round(-1/n + 1/log((2n+1)/(2n-1))). A227513