Properties of the Number 3950

Three Thousand Nine Hundred Fifty

Basics

Value: 3949 → 3950 → 3951

Parity: even

Prime: No

Previous Prime: 3947

Next Prime: 3967

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 × 5 ² × 79

Divisors: 1, 2, 5, 10, 25, 50, 79, 158, 395, 790

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111101101110

Octal: 7556

Duodecimal: 2352

Hexadecimal: f6e

Square: 15602500

Square Root: 62.849025449882674

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(n) = n*(13·n - 9)/2. A226488

Number of partitions of n, with two kinds of 1, 2, 3 and 4. A710

a(1)=0, and a(n+1) is the position of first occurrence of a(n) in the decimal expansion of 1/π. A98319

Maximum number of "feasible" partitions of length n. A254433

Triangle read by rows: T(n,k) is one-half the number of permutations of length n with exactly n-k rising or falling successions, for n >= 1, 1 <= k <= n. T(1,1) = 1 by convention. A10028

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum equal to 0 2 3 6 or 7 and every 3X3 diagonal and antidiagonal sum not equal to 0 2 3 6 or 7. A252114

Triangle read by rows: T(n,k) is the number of lone-child-avoiding rooted trees with n leaves of exactly k colors. A319376

Floor(ζ(3)ⁿ). A125890

T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero. A298712

Numbers that are the sum of six cubes in ten or more ways. A345519