12183
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 16896
- Proper Divisor Sum (Aliquot Sum)
- 4713
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7800
- Möbius Function
- -1
- Radical
- 12183
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 37
- 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
- no
- Odd
- yes
Appears in sequences
- Number of nonisomorphic connected functions with no fixed points, or proper rings with n edges.at n=11A002862
- a(n) = n OR n^3 (applied to binary expansions).at n=22A008468
- Matrix 9th power of partition triangle A008284.at n=38A050303
- A hierarchical sequence (S(W3{2,2}*cc) - see A059126).at n=8A059145
- Minimal k > n such that (4k+3n)(4n+3k) is a square.at n=30A083752
- Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 5 and (n+6) mod 8 <> 1.at n=14A096024
- Toothpick sequence in the three-dimensional grid.at n=50A160160
- Number of connected graphs with n edges with loops allowed.at n=10A191970
- G.f.: exp( Sum_{n>=1} (x^n/n) * Product_{d|n} (1 + d*x^n) ).at n=38A205478
- Numbers that match polynomials over {0,1} that have a factor containing -3 as a coefficient; see Comments.at n=14A208182
- Number of permutations in S_{n+2} containing an increasing subsequence of length n.at n=12A217200
- Numbers k such that k divides 1 + Sum_{j=1..k} prime(j)^19.at n=18A233768
- Number of compositions of n such that no part equals any of its two immediate predecessors.at n=21A261962
- The E_6-Eulerian numbers.at n=2A273000
- The E_6-Eulerian numbers.at n=4A273000
- Numbers k such that 8*10^k + 39 is prime.at n=21A280924
- a(1) = 1; a(n+1) is the smallest k > a(n) such that 2^k == 2^a(n) (mod a(n)).at n=40A306829