2883
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
- 5
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 3972
- Proper Divisor Sum (Aliquot Sum)
- 1089
- 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
- 1860
- Möbius Function
- 0
- Radical
- 93
- Omega Function (Ω)
- 3
- 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
- 141
- 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
- no
- Odd
- yes
Appears in sequences
- Coordination sequence T6 for Zeolite Code MTW.at n=35A008201
- Coordination sequence T2 for Zeolite Code DFO.at n=41A009876
- Odd numbers k that divide 25^k - 1.at n=32A014962
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A001950 (upper Wythoff sequence).at n=14A024475
- 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 34.at n=30A031532
- a(n) = 3*n^2.at n=31A033428
- Coordination sequence T1 for Zeolite Code CFI.at n=35A033599
- Number of partitions in parts not of the form 13k, 13k+3 or 13k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 5 are greater than 1.at n=31A035951
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+1 or 24k-1. Also number of partitions in which no odd part is repeated, with no part of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=50A036029
- a(n)=number of Gaussian integers z=a+bi satisfying |z|<=n+1/2, b>=0.at n=42A036707
- Numbers whose square is a difference between 2 positive cubes in at least one way.at n=34A038597
- Numerators of continued fraction convergents to sqrt(982).at n=3A042900
- Numbers k such that the string 5,3 occurs in the base 9 representation of k but not of k-1.at n=39A044299
- Numbers n such that string 8,3 occurs in the base 10 representation of n but not of n-1.at n=31A044415
- Numbers k such that string 8,3 occurs in the base 10 representation of k but not of k+1.at n=31A044796
- Has both a primitive and imprimitive representation as x^2 + xy + y^2.at n=22A045897
- Numbers with multiplicative persistence value 5.at n=33A046514
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.at n=13A049931
- Nonprime numbers k for which phi(k) + sigma(k) is an integer multiple of the cube of the number of divisors of k.at n=44A055467
- Integers > 1 whose prime divisors are all Mersenne primes (i.e., of the form (2^p - 1)).at n=35A056652