1579
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 1580
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 1578
- Möbius Function
- -1
- Radical
- 1579
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- 122
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 249
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Numbers k such that (1,k) is "good".at n=18A000696
- Flavius Josephus's sieve: Start with the natural numbers; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=44A000960
- Primes p such that the multiplicative order of 2 modulo p is (p-1)/3.at n=19A001133
- Number of connected graphs with n nodes and ceiling(n(n-1)/4) edges.at n=6A001437
- Number of partitions of n into parts 5k+1 or 5k+4.at n=54A003114
- Divisible only by primes congruent to 4 mod 7.at n=46A004622
- Class 4- primes (for definition see A005109).at n=38A005112
- Numbers k such that (3^k + 1)/4 is prime.at n=10A007658
- Prime(n)*...*a(n) is the least product of consecutive primes which is non-deficient.at n=11A007686
- Prime(n)*...*a(n) is the least product of consecutive primes which is abundant.at n=11A007708
- Coordination sequence T3 for Zeolite Code BRE.at n=26A008060
- Coordination sequence T2 for Zeolite Code DAC.at n=25A008068
- Coordination sequence T5 for Zeolite Code MTW.at n=26A008200
- Coordination sequence T8 for Zeolite Code PAU.at n=29A008226
- Number of partitions of n into at most 7 parts.at n=29A008636
- a(n) = b(n) - c(n) where b(n) is the n-th Fibonacci number greater than 2 and c(n) is the n-th number not in sequence b( ).at n=13A014251
- Primes of the form x^2 + 27y^2.at n=33A014752
- Number of triples of different integers from [ 2,n ] with no common factors between pairs.at n=32A015620
- Numbers k=3*m+1 such that 2^m == 1 (mod k).at n=34A016108
- Megaperfect numbers: numbers n where A019294(n) = min {m: n divides sigma^(m) (n)} increases to a record; sigma^(m) means apply the sum-of-divisors function m times.at n=22A019276