12162
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 24336
- Proper Divisor Sum (Aliquot Sum)
- 12174
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 4052
- Möbius Function
- -1
- Radical
- 12162
- 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
- 63
- 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) = floor(n*(n-1)*(n-2)/7).at n=45A011889
- a(n) = 1*t(n) + 2*t(n-1) + ... + k*t(n+1-k), where k=floor((n+1)/2) and t is A000201 (lower Wythoff sequence).at n=43A023866
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A000201 (lower Wythoff sequence).at n=42A024863
- Numbers k such that 189*2^k+1 is prime.at n=24A032471
- Dimension of the space of weight n cuspidal newforms for Gamma_1( 89 ).at n=37A063362
- Admirable numbers in the middle of twin primes.at n=30A135502
- Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (-1, 1), (0, -1), (1, -1), (1, 1)}.at n=9A151449
- Averages k of twin prime pairs such that 2*k^3 + 12*k^2 is a square.at n=4A154669
- Averages of twin prime pairs which can be represented as a sum of three consecutive of such pair averages.at n=17A160917
- Numbers that are divisible by exactly 3 primes (counted with multiplicity) and sandwiched between primes.at n=29A171179
- Sum of all parts minus the total number of parts of the last section of the set of partitions of n.at n=26A207035
- Smallest sets of 6 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=25A228963
- Smallest sets of 7 consecutive abundant numbers in arithmetic progression. The initial abundant number is listed.at n=3A228964
- a(n) = floor( prime(n)^3 / (n*log(n)) ).at n=24A259648
- The growth series for the affine Coxeter (or Weyl) group [3,3,5] (or H_4).at n=31A266783
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 611", based on the 5-celled von Neumann neighborhood.at n=21A273214
- G.f.: Product_{k>=1} (1 + x^k) / (1 - x^(k^2)).at n=35A280276
- Numbers k such that (754*10^k - 7)/9 is prime.at n=18A294634
- Fold a square sheet of paper alternately vertically to the left and horizontally downwards; after each fold, draw a line along each inward crease; after n folds, the resulting graph has a(n) connected components.at n=17A342762
- Numbers of the form prime(i-1)+prime(i+1) that are the average of a twin prime pair.at n=43A342993