12642
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 30096
- Proper Divisor Sum (Aliquot Sum)
- 17454
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3528
- Möbius Function
- 0
- Radical
- 1806
- Omega Function (Ω)
- 5
- Little Omega Function (ω)
- 4
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
- 156
- 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
- Coordination sequence for 7-dimensional cubic lattice.at n=6A008415
- Numbers k such that k divides 2^(k+1) - 2.at n=35A014741
- Positive integers n such that n | (2^n + n/2 - 1).at n=33A015942
- Coordination sequence for C_7 lattice.at n=3A019563
- Number of points of L1 norm 6 in cubic lattice Z^n.at n=7A035600
- Expansion of (1+3*x^2+7*x^3+15*x^4+13*x^5+15*x^6+8*x^7+4*x^8)/((1-x)*(1-x^2)^3*(1-x^3)^2).at n=16A037241
- Number of partitions satisfying cn(1,5) < cn(2,5) + cn(3,5) and cn(4,5) < cn(2,5) + cn(3,5).at n=38A039888
- a(n) = T(n,n), array T as in A050143.at n=7A050146
- Numbers k such that 53*2^k-1 is prime.at n=14A050552
- a(n) = prime(n)^2 - prime(n+1).at n=29A062235
- Square array A(n,k) read by antidiagonals: row n gives coordination sequence for lattice C_n.at n=39A103884
- Number of symmetric Schroeder paths of length 2n (A Schroeder path of length 2n is a lattice path from (0,0) to (2n,0) consisting of U=(1,1), D=(1,-1) and H=(2,0) steps and never going below the x-axis).at n=12A110110
- Triangle read by rows: T(n,k) (0 <= k <= n) is the number of Delannoy paths of length n that start with exactly k (0,1) steps (or, equivalently, with exactly k (1,0) steps).at n=29A110171
- Triangle G(n,k) read by rows: number of order-preserving partial transformations (of an n-element totally ordered set) of waist k (waist(alpha) = max(Im(alpha))).at n=35A111516
- Numbers which converge to 2592 under repeated application of the powertrain map of A133500.at n=9A135384
- a(n) = A010696(n-1) * A086892(n).at n=41A141498
- Triangle read by rows: number of nilpotent partial transformations (of an n-element set) of height r (height(alpha) = |Im(alpha)|), 0 <= r < n.at n=23A141618
- The Zeta triangle.at n=8A160474
- 14 times triangular numbers.at n=42A163756
- 6 times centered hexagonal numbers: 18*n*(n+1) + 6.at n=26A164016