2587
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
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2800
- Proper Divisor Sum (Aliquot Sum)
- 213
- 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
- 2376
- Möbius Function
- 1
- Radical
- 2587
- 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
- 146
- 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 solutions to a linear inequality.at n=45A002797
- a(n) = floor(n*phi^11), where phi is the golden ratio, A001622.at n=13A004926
- a(n) = round(n*phi^11), where phi is the golden ratio, A001622.at n=13A004946
- Sum along upward diagonal of Pascal triangle from (but not including) halfway point.at n=18A010758
- Sum along upward diagonal of Pascal triangle from halfway point.at n=18A010759
- Pseudoprimes to base 92.at n=29A020220
- Strong pseudoprimes to base 92.at n=8A020318
- a(1) = 2; a(n+1) = a(n)-th composite.at n=23A022450
- Number of partitions of n into an even number of parts, the least being 2; also, a(n+2) = number of partitions of n into an odd number of parts, each >=2.at n=40A027194
- T(n, 2n-8), T given by A027926.at n=9A027931
- a(n) = T(2*n+1, n+3), T given by A027935.at n=4A027943
- Greatest number in row n of array T given by A027935.at n=13A027945
- Lucky numbers with size of gaps equal to 12 (upper terms).at n=33A031895
- Numbers with exactly five distinct base-7 digits.at n=19A031984
- Numbers having three 5's in base 6.at n=36A043391
- Numbers k such that string 3,3 occurs in the base 8 representation of k but not of k-1.at n=40A044214
- Numbers n such that string 8,4 occurs in the base 9 representation of n but not of n-1.at n=34A044327
- Numbers n such that string 8,7 occurs in the base 10 representation of n but not of n-1.at n=27A044419
- Numbers n such that string 8,4 occurs in the base 9 representation of n but not of n+1.at n=34A044708
- Numbers k such that string 8,7 occurs in the base 10 representation of k but not of k+1.at n=27A044800