12563
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13320
- Proper Divisor Sum (Aliquot Sum)
- 757
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11808
- Möbius Function
- 1
- Radical
- 12563
- 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
- yes
- 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
- The sequence M(n) in A022905.at n=29A022908
- Number of ways to partition n labeled elements into pie slices of different sizes of at least 2, allowing the pie to be turned over.at n=11A032221
- Number of ways to partition n labeled elements into sets of different sizes of at least 2.at n=11A032311
- Numbers whose set of base-16 digits is {1,3}.at n=23A032923
- Integers n > 10583 such that the 'Reverse and Add!' trajectory of n joins the trajectory of 10583.at n=1A066055
- a(n) = n*(2*n^2 -3*n +7)/6 = C(n, 1) + C(n, 2) + 2*C(n, 3).at n=33A081489
- Numbers k such that k concatenated with k-3 gives the product of two numbers which differ by 9.at n=3A116140
- Numbers k such that k concatenated with k+5 gives the product of two numbers which differ by 7.at n=2A116195
- Number of -3..3 arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern).at n=13A200176
- Numbers k such that sigma(k - 2) = sigma(k + 2).at n=17A223091
- Number of partitions p of n such that floor(mean(p)) is a part and ceiling(mean(p)) is not.at n=41A241342
- Number of nX5 0..1 arrays with every element equal to 1, 2, 4 or 6 king-move adjacent elements, with upper left element zero.at n=11A298052
- a(n) = 2*(a(n-1)+a(n-2)+a(n-3))-a(n-4) for n >= 4, with initial terms -1, 2, 3, 6.at n=10A317973
- Maximal coefficient of (1 - x) * (1 - x^8) * (1 - x^27) * ... * (1 - x^(n^3)).at n=42A369764
- Maximum of the absolute value of the coefficients of (1 - x) * (1 - x^8) * (1 - x^27) * ... * (1 - x^(n^3)).at n=42A369987
- a(n) = (1/4) * Sum_{k=0..n-1} binomial(6*n,6*k+3).at n=3A387747