12092
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 21168
- Proper Divisor Sum (Aliquot Sum)
- 9076
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6044
- Möbius Function
- 0
- Radical
- 6046
- Omega Function (Ω)
- 3
- 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
- 94
- 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) = T(n,n-1), where T is array defined in A025564.at n=10A025565
- Eigensequence of a sequence transformation.at n=5A048286
- Number of representations of n as a sum of products of positive integers. 1 is not allowed as a factor, unless it is the only factor. Representations which differ only in the order of terms or factors are considered equivalent.at n=27A066739
- Divide the natural numbers in sets of consecutive numbers, starting with {1,2}, each set with number of elements equal to the sum of elements of the preceding set. The final element of the n-th set gives a(n).at n=4A067339
- Sum_{i=0..n} Sum_{j=0..i} a(j) * a(i-j) = (-3)^n.at n=10A085455
- Triangle read by rows: a(n,k) = number of paths of n upsteps U and n downsteps D that contain k UDUs.at n=46A097692
- n + sigma(n) + phi(n) is a cube.at n=8A116008
- Row sums of triangle A124526.at n=9A124527
- a(1) = a(2) = 1; a(n+1) = round( a(n) + sqrt(3)*a(n-1) ).at n=15A133999
- Number of permutations of floor(i*5/3), i=0..n-1, with all sums of 2 through 4 adjacent terms respectively unique.at n=7A147935
- Number of permutations of floor(i*5/3), i=0..n-1, with all sums of 2 through 5 adjacent terms respectively unique.at n=7A147944
- Transform of C(n+1,floor((n+1)/2)) by A178112.at n=19A178113
- Parameters n for which the elliptic curve y^2=x^3+n has rank 4.at n=13A179124
- Successive records in maximal positive distance d = x^3 - y^2.at n=43A198831
- Number of 6 X 6 0..n matrices with each 2 X 2 subblock idempotent.at n=36A224668
- Riordan array read by rows, corresponding to array in A180562.at n=55A239101
- Smallest k such that the union of {A242033(i): 1 <= i <= k} and {A242034(i): 1 <= i <= k} includes all primes {3, ..., prime(n)}.at n=46A242064
- P-positions for the subtraction game whose allowed moves are the practical numbers (A005153).at n=32A275432
- Triangle T(m,k) read by rows, where T(m,k) is the number of ways in which 1<=k<=m positions can be picked in an m X m square grid such that the center of gravity of the k picked positions coincides with one of the picked positions.at n=20A291716
- a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = -1, a(1) = -1, a(2) = 2, a(3) = 1.at n=17A295852