2489
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2640
- Proper Divisor Sum (Aliquot Sum)
- 151
- 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
- 2340
- Möbius Function
- 1
- Radical
- 2489
- 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 primes < prime(n)^2.at n=34A000879
- Numbers k such that the continued fraction for sqrt(k) has period 46.at n=11A020385
- a(0)=0, a(2*n) = 2*a(n) + 2*a(n-1) + n^2 + n, a(2*n+1) = 4*a(n) + (n+1)^2.at n=41A022560
- a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n+1-k), where k = [ (n+1)/2 ], p = A000040 = the primes.at n=15A024697
- Coordination sequence T4 for Zeolite Code MWW.at n=34A024989
- a(n) = p(1)p(n) + p(2)p(n-1) + ... + p(k)p(n-k+1), where k = [ n/2 ], p = A000040, the primes.at n=15A025129
- Number of partitions satisfying cn(2,5) <= 1 and cn(3,5) <= 1.at n=32A039855
- Number of partitions satisfying cn(0,5) + cn(2,5) <= cn(1,5) + cn(4,5) and cn(0,5) + cn(3,5) <= cn(1,5) + cn(4,5).at n=27A039887
- Numerators of continued fraction convergents to sqrt(239).at n=5A041446
- Numerators of continued fraction convergents to sqrt(878).at n=6A042696
- Denominators of continued fraction convergents to sqrt(975).at n=4A042887
- Numbers whose base-3 representation has exactly 8 runs.at n=9A043588
- Numbers whose base-7 representation has exactly 5 runs.at n=28A043620
- Numbers whose number of runs in base 3 is congruent to 1 (mod 7).at n=23A043792
- Numbers n such that number of runs in the base 3 representation of n is congruent to 0 mod 8.at n=9A043798
- Numbers n such that number of runs in the base 3 representation of n is congruent to 8 mod 9.at n=9A043814
- Numbers k such that number of runs in the base 3 representation of k is congruent to 8 mod 10.at n=9A043823
- Numbers k such that the string 6,5 occurs in the base 9 representation of k but not of k-1.at n=33A044310
- Numbers n such that string 8,9 occurs in the base 10 representation of n but not of n-1.at n=24A044421
- Numbers n such that string 6,5 occurs in the base 9 representation of n but not of n+1.at n=33A044691