12083
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
- 4
- Divisor Sum
- 12408
- Proper Divisor Sum (Aliquot Sum)
- 325
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11760
- Möbius Function
- 1
- Radical
- 12083
- 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
- 68
- 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
- no
- Odd
- yes
Appears in sequences
- Strong pseudoprimes to base 32.at n=21A020258
- Strong pseudoprimes to base 59.at n=17A020285
- Numbers k such that Euler phi(k) / Carmichael lambda(k) = 14.at n=26A066696
- Numbers n such that n and prime(n) end with the same three digits.at n=8A067841
- a(n) = sum of the first n lower twin primes.at n=34A086167
- The sum of a triangular array made from a negative 6-fold permutation product.at n=13A105156
- a(n) = prime(n) * Sum_{i=1..n} prime(i).at n=13A143215
- Numbers that are the product of two distinct primes a and b, such that a^3+b^3 is the average of a twin prime pair.at n=34A176876
- Construct sequences P,Q,R by the rules: Q = first differences of P, R = second differences of P, P starts with 1,3,9, Q starts with 2,6, R starts with 4; at each stage the smallest number not yet present in P,Q,R is appended to R. Sequence gives P.at n=36A225385
- Number of partitions p of n such that if h = min(p), then h is an (h,0)-separator of p; see Comments.at n=49A239510
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 403", based on the 5-celled von Neumann neighborhood.at n=26A271809
- Expansion of Product_{k>=1} 1/(1 - x^k)^(k*(k+1)*(4*k-1)/6).at n=8A279217
- a(n) = -n^3 + 70*n^2 - 939*n + 2393.at n=34A279538
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + 2*b(n-1) - b(n-2) - 1, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A294564
- a(n) = n * Sum_{k prime<=n} k.at n=42A301707
- a(n) = (n^2 + 1) * 5^n + (n^2 + 2) * 3^n.at n=4A304578
- a(n) = [x^n] Product_{k>=1} (1 + x^k)^J_n(k), where J_() is the Jordan function.at n=5A321265
- Numbers that are the sum of eight fourth powers in seven or more ways.at n=14A345582
- Numbers that are the sum of eight fourth powers in exactly seven ways.at n=14A345839
- The inverse Euler transform of p(n) = n if n is prime, otherwise 1.at n=25A358452