7914
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15840
- Proper Divisor Sum (Aliquot Sum)
- 7926
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 2636
- Möbius Function
- -1
- Radical
- 7914
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 3
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
- 52
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- yes
- 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
- G.f.: -1 + Product_{k>=1} (1 + prime(k)*x^prime(k)).at n=33A002099
- Number of partitions of n with equal number of parts congruent to each of 0, 2 and 4 (mod 5).at n=51A035576
- Numbers whose base-4 representation contains exactly four 2's and two 3's.at n=28A045155
- Number of n-celled polyominoes without holes, symmetric about axis 2.at n=32A056880
- McKay-Thompson series of class 40C for Monster.at n=44A058664
- Gregorian calendar years with Ascension Day in April.at n=32A084427
- Numbers k such that k^2 + 11 and k^2 + 13 are primes.at n=33A113537
- a(n) = Sum {j=1..n} j*A001462(j).at n=40A143125
- Numbers k such that k^3 +-5 are primes.at n=34A176684
- Number of n X 1 0..3 arrays with rows and columns lexicographically nondecreasing and every element equal to at least one horizontal or vertical neighbor.at n=37A201618
- Denominators of Bernoulli numbers which are congruent to 3 (mod 9).at n=41A219543
- Bernoulli denominators with 8 divisors in increasing order (without repetitions).at n=36A219742
- Number of partitions of n for which 2*(number of distinct parts) > (number of parts).at n=37A237365
- Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) < number of parts of p.at n=33A241828
- Numbers k such that 7*10^k - 69 is prime.at n=20A281643
- Numbers k such that 4 is the smallest decimal digit of k^3.at n=16A291643
- Partial sums of A097988 (d_3(n)^2).at n=41A330570
- Number of compositions of n that are both a reversed Lyndon word and a co-Lyndon word.at n=18A334269
- Number of true-palindromic compositions of n.at n=25A338739
- Number of distinct sets { p(i) - p(j) : 1 <= i <= j <= n } where p ranges over all permutations of [n].at n=20A343419