Properties of the Number 68032

Sixty-Eight Thousand Thirty-Two

Basics

Value: 68031 → 68032 → 68033

Parity: even

Prime: No

Previous Prime: 68023

Next Prime: 68041

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 ⁶ × 1063

Divisors: 1, 2, 4, 8, 16, 32, 64, 1063, 2126, 4252

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: 10000100111000000

Octal: 204700

Duodecimal: 33454

Hexadecimal: 109c0

Square: 4628353024

Square Root: 260.8294461904177

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

a(0)=1; for n>0, a(n) = 2·5^n-1 - (1/2)*∑_i=1..n-1 a(i)*a(n-i). A85362

T(n,[ n/2 ]), where T is the array in A026386. A26392

Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial transform. Same as interpolating bilateral Schroeder paths (A026375) with the central binomial coefficients (A000984). A163841

a(n) = ∑_k=0..n binomial(2·n, n-k) * p(k), where p(k) is the partition function A000041. A356280

a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=0; also a(n) = T(2n,n). A26387

Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k peaks at odd height. A101894

Wolstenholme quotient W_p = (binomial(2p-1,p) - 1)/p³ for prime p=A000040(n). A34602

Wolstenholme primes: primes p such that binomial(2p-1,p-1) == 1 (mod p⁴). A88164

Number of ways to write n as p + 2^k + (1+(n mod 2))*5^m, where p is an odd prime, and k and m are nonnegative integers with 2^k + (1+(n mod 2))*5^m squarefree. A304081

Number of ways to write n = k² + m with k > 0 and m >= k² such that σ(k²) + φ(m) is prime, where σ(k²) is the sum of all (positive) divisors of k², and φ(.) is Euler's totient function (A000010). A233544