Properties of the Number 3990

Three Thousand Nine Hundred Ninety

Basics

Value: 3989 → 3990 → 3991

Parity: even

Prime: No

Previous Prime: 3989

Next Prime: 4001

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 7 × 19

Divisors: 1, 2, 3, 5, 6, 7, 10, 14, 15, 19

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111110010110

Octal: 7626

Duodecimal: 2386

Hexadecimal: f96

Square: 15920100

Square Root: 63.166446789415026

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*(n+1)*(n+2)/2. A27480

Products of exactly 5 distinct primes. A46387

Number of subsets of {1..n} containing n such that some element can be written as a nonnegative linear combination of the others. A365046

Numbers k such that k² divides 11^k - 1. A127092

Least number k such that all coefficients of k·B(n,x), the n-th Bernoulli polynomial, are integers. A144845

Numbers that are divisible by exactly 5 different primes. A51270

a(n) = n·A276086(n). A324580

Triangle read by rows: T(n,k) = number of forests of k labeled rooted trees of height at most 1, with n labels, where any root may contain >= 1 labels, n >= 0, 0 <= k <= n. A143395

Number T(n,k) of simple labeled graphs on n nodes with exactly k connected components that are trees or cycles; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A215861

Table read by ascending antidiagonals: n-th row of table consists of the positive integers divisible by exactly n distinct primes. A125666