12596
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
- 12
- Divisor Sum
- 22848
- Proper Divisor Sum (Aliquot Sum)
- 10252
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6072
- Möbius Function
- 0
- Radical
- 6298
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor( n/2 ), s = natural numbers >= 3.at n=47A024875
- a(n) = (2*n-1)*(n^2 -n +6)/6.at n=33A049480
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(4) = 4.at n=14A049930
- Denominators a(n) of Pythagorean approximations b(n)/a(n) to 5/4.at n=5A195565
- Number of -1..1 arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences.at n=10A200197
- Phi(n) values in A115921.at n=30A216381
- Start with a single pentagon; at n-th generation add a pentagon at each expandable vertex; a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)at n=17A247619
- Number of length n permutations avoiding (123,{1},{}) and (231,{},{2}).at n=11A249561
- Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011.at n=8A260494
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011.at n=36A260501
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000001 00000011 or 00001011.at n=44A260501
- Predestined numbers A262743 in which every term is generated by at least one pair of products where all (and only those) first product's factor's digits are, in reverse order, the same as those of the second two factors.at n=39A262873
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 278", based on the 5-celled von Neumann neighborhood.at n=33A271097
- A292764(n)/2.at n=15A292765
- a(n) = Sum_{d|n} d^tau(n/d).at n=47A345270
- a(n) = number of pairs (p,q) of partitions of n such that d(p,q) > o(p,q), where d and o are distance functions; see Comments.at n=22A368566