Properties of the Number 7940

Seven Thousand Nine Hundred Forty

Basics

Value: 7939 → 7940 → 7941

Parity: even

Prime: No

Previous Prime: 7937

Next Prime: 7949

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 5 × 397

Divisors: 1, 2, 4, 5, 10, 20, 397, 794, 1588, 1985

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1111100000100

Octal: 17404

Duodecimal: 4718

Hexadecimal: 1f04

Square: 63043600

Square Root: 89.10667763978185

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

Numbers n such that Bernoulli number B_n has denominator 330. A272183

Row 3 of A007754. A58794

Union_{odd primes p, n >= 3} {T_p(n)}, where T_m(x) = x·T_m-1(x) - T_m-2(x), m >= 2, T₀(x) = 2, T₁(x) = x (dilated Chebyshev polynomials of the first kind). A299071

a(n) = n³ - 3·n. A121670

Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from an n·n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle. A360354

a(n) = 8·n² + 8·n + 4. A108099

T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order. A229460

a(n) = 2n·a(n-1) - (n-1)²*a(n-2). A2793

Expansion of ∏_k>=1 ((1 + x^4·k) / (1 - x^k))^k. A285460

Number of partitions p of n such that the number of parts having multiplicity 1 is not a part and max(p) - min(p) is not a part. A241450