1983
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 2648
- Proper Divisor Sum (Aliquot Sum)
- 665
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1320
- Möbius Function
- 1
- Radical
- 1983
- 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
- 50
- 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
- Number of 3-line partitions of n.at n=14A000991
- Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2.at n=27A001608
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=43A003107
- If a, b in sequence, so is ab+5.at n=31A009304
- Coefficients in expansion of Pi as Sum_{n>=1} a(n)/(n*n!*(n+1)!), as found by greedy algorithm.at n=45A011191
- Number of unlabeled (and unrooted) trees on n nodes having a centroid.at n=14A027416
- a(n) = n^2 + n + 3.at n=44A027688
- T(n, 2*n-3), T given by A027960.at n=20A027965
- Binary expansion contains a single 0.at n=49A030130
- Numbers whose base-4 representation has 4 fewer 0's than 3's.at n=14A031469
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 28.at n=25A031526
- "DHK" (bracelet, identity, unlabeled) transform of 1,0,1,0,... (odd).at n=24A032243
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+9 or 20k-9. Also number of partitions in which no odd part is repeated, with at most 4 parts of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=36A036028
- Sums of 10 distinct powers of 2.at n=4A038461
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 8.at n=44A038639
- Numbers k such that 3 and 8 occur juxtaposed in the base-10 representation of k but not of k-1.at n=39A043244
- Numbers having four 3's in base 4.at n=20A043348
- Numbers k such that 3 and 8 occur juxtaposed in the base-10 representation of k but not of k+1.at n=39A044024
- Numbers k such that string 3,2 occurs in the base 7 representation of k but not of k-1.at n=46A044161
- Numbers n such that string 7,7 occurs in the base 8 representation of n but not of n-1.at n=30A044250