8940
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 25200
- Proper Divisor Sum (Aliquot Sum)
- 16260
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 2368
- Möbius Function
- 0
- Radical
- 4470
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- no
- Triangular Number
- no
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- no
- Lucas Number
- no
- Tetrahedral Number
- no
- Pell Number
- no
- Tribonacci Number
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 47
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- Prime Power
- no
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Appears in sequences
- Number of n-node forests not determined by their spectra.at n=14A006611
- a(n) = n*(31*n + 1)/2.at n=24A022289
- Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,3.at n=43A064238
- The number of distinct parts in the partition sequence lambda(n) formed by the recurrence lambda(1) = 1 and lambda(n+1) is the sum of lambda(n) and its conjugate.at n=27A064660
- Numbers n such that A001414(n) = sum of squared digits of n.at n=18A094908
- Record gaps between prime quadruplets.at n=8A113404
- Number of 12 X 12 arrays of squares of integers, symmetric under 90-degree rotation, with all rows summing to n.at n=2A156411
- Number of n X n arrays of squares of integers, symmetric under 90-degree rotation, with all rows summing to 2.at n=10A156431
- Numerator of Hermite(n, 3/7).at n=4A158987
- Triangle interpolating the swinging factorial (A056040) restricted to even indices with its binomial transform. Same as interpolating bilateral Schroeder paths (A026375) with the central binomial coefficients (A000984).at n=31A163841
- a(n) = n*(12*n^3 + 10*n^2 - 9*n - 7)/6.at n=8A172080
- Partial sums of A050508.at n=25A178129
- Number of subsets of {1, 2, ..., n} containing n and having <=9 pairwise coprime elements.at n=37A186993
- Number of nX3 0..1 arrays with row sums unimodal and column sums inverted unimodal.at n=4A223778
- Number of nX5 0..1 arrays with row sums unimodal and column sums inverted unimodal.at n=2A223780
- T(n,k) = Number of n X k 0..1 arrays with row sums unimodal and column sums inverted unimodal.at n=23A223782
- T(n,k) = Number of n X k 0..1 arrays with row sums unimodal and column sums inverted unimodal.at n=25A223782
- Numbers k such that sigma(tau(phi(k))) = phi(tau(sigma(k))).at n=42A226118
- Numbers k such that k+1, 2*k+1 and k^2+1 are primes.at n=34A236692
- Numbers divisible by prime(d) for each digit d in their base-9 representation, none of which may be zero.at n=33A256879