12662
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
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20496
- Proper Divisor Sum (Aliquot Sum)
- 7834
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 5832
- Möbius Function
- -1
- Radical
- 12662
- Omega Function (Ω)
- 3
- 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
- 55
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- a(n) = A027113(n, 2n).at n=11A027118
- Number of 5-unbalanced strings of length n (=2^n-A027560(n)).at n=15A027562
- Number of primitive (period n) step cyclic shifted sequences using a maximum of three different symbols.at n=11A056420
- Let C(n) = product of composite numbers between the n-th prime and (n+1)-th prime; a(n) = floor(C(n+1)/C(n)).at n=26A073836
- Duplicate of A099760.at n=6A099758
- a(n+1) = 2*n*a(n) + 2 with a(0)=1.at n=6A099760
- Number of (w,x,y,z) with all terms in {0,...,n} and w=max{w,x,y,z}-2*min{w,x,y,z}.at n=19A212745
- Principal diagonal of the convolution array A213825.at n=12A213826
- a(1) = greatest k such that H(k) - H(4) < 1/3 + 1/4; a(2) = greatest k such that H(k) - H(a(1)) < H(a(1)) - H(4); and for n > 2, a(n) = greatest k such that H(k) - H(a(n-1)) > H(a(n-1)) - H(a(n-2)), where H = harmonic number.at n=19A224868
- Triangle T(n,k): the number of binary sequences of n zeros and n ones in which the shortest run is of length k.at n=28A227924
- Number of n-bit legal circular binary words with maximal set of 1's.at n=28A253413
- Number of length n+7 0..2 arrays with at most one downstep in every 7 consecutive neighbor pairs.at n=4A255106
- Number of length n+5 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=6A255112
- Number of minimal total dominating sets in the n-Moebius ladder.at n=13A303162
- a(n) = n! * Sum_{k=1..n} ( Sum_{d|k} (-1)^(k/d+1) * d )/(k * (n-k)!).at n=6A354507
- Irregular triangle read by rows: T(n,k) (0 <= k <= n^2) are coefficients of exact wrapping probability for site percolation on an n X n 2D nnsquare lattice with periodic boundary conditions. This is for the probability that it wraps in either dimension.at n=25A365955
- Numbers k such that the total number of digits d in the numbers from 1 to k is even for each d from 0 to 9.at n=23A380642