2589
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 24
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3456
- Proper Divisor Sum (Aliquot Sum)
- 867
- 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
- 1724
- Möbius Function
- 1
- Radical
- 2589
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 2
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
- 40
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of connected unlabeled graphs with n nodes and degree >= 3.at n=7A007112
- Coordination sequence T4 for Zeolite Code MEI.at n=37A008149
- Second differences of Bell numbers.at n=6A011965
- 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).at n=33A011971
- Sequence formed by reading rows of triangle defined in A011971.at n=26A011972
- Coordination sequence T5 for Zeolite Code MWW.at n=34A024990
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 32.at n=26A031530
- Numbers with exactly five distinct base-7 digits.at n=20A031984
- Numbers that, when expressed in base 7 and then interpreted in base 10, yield a multiple of the original number.at n=17A032549
- Multiplicity of highest weight (or singular) vectors associated with character chi_191 of Monster module.at n=37A034579
- Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5).at n=32A035555
- The number of decompositions of n into different parts relatively prime to n.at n=46A036998
- Numbers n such that string 8,6 occurs in the base 9 representation of n but not of n-1.at n=34A044329
- Numbers n such that string 8,9 occurs in the base 10 representation of n but not of n-1.at n=25A044421
- Numbers n such that string 8,6 occurs in the base 9 representation of n but not of n+1.at n=34A044710
- Numbers n such that string 5,8 occurs in the base 10 representation of n but not of n+1.at n=28A044771
- Numbers k such that string 8,9 occurs in the base 10 representation of k but not of k+1.at n=25A044802
- Triangle T(n,k) giving number of rooted maps regardless of genus with n edges and k nodes (n >= 0, k = 1..n+1).at n=16A053979
- Triangle T(n,k) is the number of restricted growth strings (RGS) of set partitions of {1..n} that have an increase at index k (1<=k<n).at n=22A056861
- Number of distinct differences between consecutive divisors of n! (ordered by size).at n=16A060737