Properties of the Number 3934

Three Thousand Nine Hundred Thirty-Four

Basics

Value: 3933 → 3934 → 3935

Parity: even

Prime: No

Previous Prime: 3931

Next Prime: 3943

Digit Sum: 19

Digital Root: 1

Palindrome: No

Factorization: 2 × 7 × 281

Divisors: 1, 2, 7, 14, 281, 562, 1967, 3934

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111101011110

Octal: 7536

Duodecimal: 233A

Hexadecimal: f5e

Square: 15476356

Square Root: 62.72160712226688

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 with zero crank. A64410

Triangle T(n,k), 0 <= k <= n, read by rows given by: T(0,0)=1, T(n,k)=0 if k < 0 or if k > n, T(n,0) = 3·T(n-1,0) + T(n-1,1), T(n,k) = T(n-1,k-1) + T(n-1,k) + T(n-1,k+1) for k >= 1. A126954

Number of integer partitions of n that can be partitioned into distinct pairs of (possibly equal) parts. A338916

Number of integer partitions of n with a neighborless part. A356236

T(n,k)=Number of length-n 0..k arrays with no repeated value differing from the previous repeated value by other than one. A269537

Partitions with superdiagonal growth: number of partitions (p0, p1, p2, ...) of n with π - p0 >= i. A238860

Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,5,11, Q starts with 4,6, R starts with 2; at each stage the smallest number not yet present in P,Q,R is appended to R; every number appears exactly once in the union of P,Q,R. Sequence gives P. A225376

Number of subsets of {1..n} whose cardinality is not the sum of two distinct elements. A367400

Triangle read by rows: Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 2k+1. A227716

Number T(n,k) of permutations p of [n] having at least one index i with |p(i)-i| = k; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows. A306506