12587
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12936
- Proper Divisor Sum (Aliquot Sum)
- 349
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12240
- Möbius Function
- 1
- Radical
- 12587
- 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
- 63
- 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 blobs with 2n+1 edges.at n=8A007166
- a(n) = n*(15*n - 1)/2.at n=41A022272
- a(n)=Sum{T(n,j): j=1,2,...,n}, array T given by A048201.at n=25A048209
- Number of isomorphism classes of 4-regular multigraphs of order n, loops allowed.at n=8A129429
- Square array T(n,k), read by upward antidiagonals, counting isomorphism classes of k-regular multigraphs of order n, loops allowed.at n=82A167625
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=40A181881
- Starting with Fibonacci(0), the sum of a(n) successive Fibonacci numbers is prime.at n=22A214874
- Number of length n+7+1 0..7 arrays with every value 0..7 appearing at least once in every consecutive 7+2 elements, and new values 0..7 introduced in order.at n=8A242238
- Numbers n such that (6k-1) for k=n, n+1, n+2, n+3 are all primes with no primes of the form (6k+1) in between.at n=12A296011
- Mark each point on the n X n X n X n grid with the number of points that are visible from it; a(n) is the number of distinct values in the grid.at n=50A339947
- Number of partitions of n into 6 or more distinct parts.at n=44A347573
- Expansion of A(x) satisfying [x^n] A(x)^n / (1 + x*A(x)^n)^n = 0 for n > 0.at n=6A360581