12366
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 27600
- Proper Divisor Sum (Aliquot Sum)
- 15234
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4104
- Möbius Function
- 0
- Radical
- 1374
- Omega Function (Ω)
- 5
- 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
- yes
- Harshad Number
- yes
- 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
- Number of two-rowed partitions of length 3.at n=39A001993
- Numbers k such that 67*2^k+1 is prime.at n=28A032383
- a(n) = floor(exp(n - gamma)), where gamma is Euler's constant.at n=10A078141
- Numbers n such that the best rational approximation to H(n) with denominator <=n is an integer, where H(n) denotes the n-th harmonic number (A001008/A002805).at n=17A079353
- a(n) = largest m such that the harmonic number H(m)= Sum_{i=1..m} 1/i is < n.at n=9A115515
- Numbers k such that k concatenated with k+4 gives the product of two numbers which differ by 9.at n=2A116190
- Numerators of the continued fraction convergents of the decimal concatenation of the lower bound of twin primes.at n=17A128844
- Half-sum (or average) of cubes of two distinct odd primes.at n=30A138855
- Number of subsets {x(1),x(2),...,x(k)} of {1,2,...,n} such that all differences |x(i)-x(j)| are distinct.at n=22A143823
- Number of n X n X n 0..6 triangular arrays with each element x equal to the number its neighbors equal to 3,3,2,1,0,0,2 for x=0,1,2,3,4,5,6.at n=5A197949
- Array T(m,n) = greatest k such that 1/n + ... + 1/(n+k-1) <= m, by rising antidiagonals.at n=45A214966
- Array t(n,k): row n consists of the positive integers m for which the least splitter of H(m) and H(m+1) is n, where H denotes harmonic number.at n=45A227631
- 1 followed by the union of the terms > 2 in A002387 (or A004080) and A115515.at n=17A242654
- Number of (6+2) X (n+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=24A252725
- Sum of the lengths of the arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2.at n=34A264100
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 81", based on the 5-celled von Neumann neighborhood.at n=26A270100
- Square array read by antidiagonals downwards: T(k,n) = sum of the site-perimeters of words of length n >= 1 over an alphabet of size k >= 1.at n=30A292767
- T(m,n) is the least k such that the partial sum of the series Sum_{j=0..k} 1/(m*j+1) is > n, read by ascending antidiagonals.at n=54A337748
- G.f.: 1/Product_{k>=1} (1 - x^(3*k^2)) * (1 - x^k).at n=30A385012