Properties of the Number 4140

Four Thousand One Hundred Forty

Basics

Value: 4139 → 4140 → 4141

Parity: even

Prime: No

Previous Prime: 4139

Next Prime: 4153

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ² × 5 × 23

Divisors: 1, 2, 3, 4, 5, 6, 9, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 1000000101100

Octal: 10054

Duodecimal: 2490

Hexadecimal: 102c

Square: 17139600

Square Root: 64.34283176858165

Classification

Fibonacci: No

Bell Number: Yes

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

Bell or exponential numbers: number of ways to partition a set of n labeled elements. A110

4 times triangular numbers: a(n) = 2·n*(n+1). A46092

Triangle read by rows, Bell transform of Bell numbers. A264428

Expansion of ∏_m>=1 1/(1-x^m)^A000009(m). A89259

Aitken's array: triangle of numbers {a(n,k), n >= 0, 0 <= k <= n} read by rows, defined by a(0,0)=1, a(n,0) = a(n-1,n-1), a(n,k) = a(n,k-1) + a(n-1,k-1). A11971

Number T(n,k) of collections of nonempty multisets with a total of n objects of exactly k colors; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A255903

e-perfect numbers: numbers k such that the sum of the e-divisors (exponential divisors) of k equals 2·k. A54979

Coreful perfect numbers: numbers k such that csigma(k) = 2·k, where csigma(k) is the sum of the coreful divisors of k (A057723). A307958

Triangle read by rows: T(n,c) = number of successive equalities in set partitions of n. A56857

a(n) = σ(n) * A003961(n), where A003961 shifts the prime factorization of n one step towards larger primes, and σ is the sum of the divisors of n. A341529