5285
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7296
- Proper Divisor Sum (Aliquot Sum)
- 2011
- 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
- 3600
- Möbius Function
- -1
- Radical
- 5285
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 103
- 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
- a(n) = round(1000*log_2(n)).at n=38A004266
- a(n) = floor( n*(n-1)*(n-2)*(n-3)/22 ).at n=20A011932
- (n,3,6) difference families over Z_n.at n=8A011996
- Apply partial sum operator thrice to primes.at n=13A014150
- Expansion of 1/((1-4x)(1-5x)(1-6x)(1-10x)).at n=3A028112
- a(n) = floor(exp(1/21) * n!).at n=6A030851
- Decimal part of a(n)^(1/11) starts with n (11th powers excluded).at n=18A034066
- a(0)=2; a(n) is the smallest k > a(n-1) such that the fractional part of k^(1/11) starts with n.at n=18A034076
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15.at n=13A034858
- a(n) = C(n+3,4) + 3*C(n+1,3) + 5*C(n-1,2) + 7*n - 15 for n >= 3; a(1)=1, a(2)=10.at n=14A034859
- Numerators of continued fraction convergents to sqrt(825).at n=9A042592
- Denominators of continued fraction convergents to sqrt(886).at n=12A042713
- The sequence e when b=[ 1,1,1,0,1,1,... ].at n=53A042957
- Numbers having three 2's in base 9.at n=30A043463
- Numbers whose base-2 representation has exactly 11 runs.at n=24A043578
- a(n) = (1/2)*(n-th number whose base-2 representation has exactly 12 runs).at n=26A043686
- Numbers n such that number of runs in the base 2 representation of n is congruent to 1 mod 10.at n=36A043764
- Numbers whose base-4 representation contains exactly four 1's and two 2's.at n=30A045107
- Numbers of the form p*q*r where p,q,r are distinct odd palindromic primes (odd terms from A002385).at n=20A046405
- a(n) is the unique positive integer m which has a self-conjugate partition whose parts are the first n primes.at n=29A067773