7958
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 29
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 12528
- Proper Divisor Sum (Aliquot Sum)
- 4570
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3784
- Möbius Function
- -1
- Radical
- 7958
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 96
- 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
- Number of directed site animals with no loops enumerated by area (or number of sites).at n=10A010374
- Numbers whose base-5 representation contains exactly two 2's and three 3's.at n=33A045273
- n*10^2-1, n*10^2-3, n*10^2-7 and n*10^2-9 are all prime.at n=16A064976
- Difference between product of divisors of n and sum of divisors of n.at n=19A076721
- Number of terms in the expansion of Product(x_i + x_{i+1} + ... + x_j) over 1 <= i < j <= n.at n=6A087422
- Number of two-dimensional burst patterns of size n, i.e., translation inequivalent subsets of the grid Z^2 which can be covered by a connected subset of n elements (in the sense of von Neumann neighborhoods).at n=6A093424
- Pierce expansion of the cube root of 1/2.at n=7A140076
- Product plus sum of four consecutive nonnegative numbers.at n=8A166941
- a(n) = 2^n - Fibonacci(n) - 1.at n=13A228078
- The number of integer partitions P of n such that either the length k of P is not a part or P has at least one part equal to 1 (or both).at n=32A229863
- Number of nX3 0..3 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=9A239853
- Number of nX7 0..2 arrays with no element equal to zero plus the sum of elements to its left or zero plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 3.at n=8A240038
- a(0)=1, a(1)=3, and the INVERT transform of the sequence deletes the 3.at n=8A259845
- Largest number k such that exactly half the numbers in [1..k] are prime(n)-smooth.at n=37A308904
- Number of partitions of n into colored blocks of equal parts, such that all colors from a set of size nine are used and the colors are introduced in increasing order.at n=16A327292
- G.f.: Sum_{k>=1} (x^(k*(k+1)) * Product_{j=1..k} (1 + x^j)/(1 - x^j)).at n=52A333374
- Sum of the largest parts t of the partitions of n into 4 parts q,r,s,t such that 1 <= q <= r <= s <= t and q + r + s > t.at n=47A340249
- Number of integer compositions of n whose leaders of anti-runs are distinct.at n=16A374518
- a(0) = 1; thereafter a(n) = 2*(6*n^2 - 3*n + 1).at n=26A386477