12086
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
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 18132
- Proper Divisor Sum (Aliquot Sum)
- 6046
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6042
- Möbius Function
- 1
- Radical
- 12086
- Omega Function (Ω)
- 2
- 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
- 125
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- Numbers k such that the continued fraction for sqrt(k) has period 98.at n=13A020437
- Expansion of (1-x)^(-1)/(1-x-2*x^2+x^3).at n=15A077865
- Positive integers k such that k!!! - 1 = A007661(k) - 1 is prime.at n=19A084438
- Ramanujan numbers (A000594) read mod 16384.at n=12A126824
- G.f. satisfies: A(x) = P(x*A(x))^2 where A(x/P(x)^2) = P(x)^2 and P(x) is the g.f. for Partition numbers (A000041).at n=6A171803
- Numbers n such that 10^n - 83 is prime.at n=14A178438
- The sums of pairs of adjacent terms are the odd palindromic primes in ascending order.at n=38A181883
- Number of partitions of n whose median is a part.at n=34A238478
- Number of (n+2) X (5+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 or 01010101.at n=5A259739
- Number of (n+2) X (6+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00010101 or 01010101.at n=4A259740
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010101 or 01010101.at n=49A259742
- T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00010101 or 01010101.at n=50A259742
- a(n) is the smallest k > 1 such that n^k starts and ends with n, or -1 if there is no such k.at n=20A378857
- Number of integer partitions of n such that the product of parts is greater than the sum of primes indexed by the parts.at n=34A380411