12536
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
- 8
- Divisor Sum
- 23520
- Proper Divisor Sum (Aliquot Sum)
- 10984
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6264
- Möbius Function
- 0
- Radical
- 3134
- Omega Function (Ω)
- 4
- 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
- no
- Squarefree Number
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = (n+2)*a(n-1) + (-1)^n.at n=6A006348
- Let S(x,y) = number of lattice paths from (0,0) to (x,y) that use the step set { (0,1), (1,0), (2,0), (3,0), ...} and never pass below y = x. Sequence gives S(n-1,n) = number of 'Schröder' trees with n+1 leaves and root of degree 2.at n=7A010683
- Triangle of numbers S(x,y) = number of lattice paths from (0,0) to (x,y) that use step set { (0,1), (1,0), (2,0), (3,0), ....} and never pass below y = x.at n=43A011117
- Triangle read by rows: T(n,k) is the number of dissections of a convex n-gon by nonintersecting diagonals, having a k-gon over a fixed edge (base).at n=28A091370
- Number of partitions of 2n in which both odd parts and parts that are multiples of 3 occur with even multiplicities. There is no restriction on the other even parts.at n=24A101230
- Triangle read by rows: T(n,k) is number of Schroeder paths of length 2n and having k peaks at height 1, for 0 <= k <= n.at n=37A104219
- Times in hours, minutes and seconds (to the nearest second) at which the hour and minute hands of an analog clock, if interchanged, continue to indicate some other albeit accurate times, over a complete 12-hour sweep for the slower hand. Leading zeros omitted.at n=17A121577
- a(n) = 196*n^2 - n.at n=7A158003
- a(n) = 784*n^2 - 2*n.at n=3A158398
- a(n) = 64*n^2 - 8.at n=13A158487
- a(n)^3 ends in n^3.at n=36A167178
- Number of 4-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=20A187157
- Number of (w,x,y,z) with all terms in {1,...,n} and 3w=x+y+z+n.at n=31A212247
- Records in A224796.at n=25A224719
- a(n) is the number of nonnegative integers that can be represented in a 7-segment display by using only n segments (version A010371).at n=21A331530
- Smallest even fundamental discriminant k such that h(-k) = 2n, where h(D) is the class number of the quadratic field with discriminant D; or 0 if no such k exists.at n=43A344072
- Number of integer partitions of n with reverse-alternating sum < 0.at n=38A344608
- Number of integer partitions of 2n with reverse-alternating sum < 0.at n=19A344743
- Triangle read by rows: T(n,k) = n * T(n-1,k) + (-1)^(n-k) for 0 <= k <= n with initial values T(n,k) = 0 if n < 0 or k < 0 or k > n.at n=49A352650
- Number of integer partitions of n such that the maximum is greater than twice the median.at n=34A361857