5337
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 7722
- Proper Divisor Sum (Aliquot Sum)
- 2385
- 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
- 3552
- Möbius Function
- 0
- Radical
- 1779
- 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
- 54
- 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
- a(n) = (10*n^3 - 9*n^2 + 2*n)/3 + 1.at n=12A034721
- Number of different products of partitions of n; number of partitions of n into prime parts (1 included); number of distinct orders of Abelian subgroups of symmetric group S_n.at n=46A034891
- Positive numbers having the same set of digits in base 5 and base 8.at n=43A037431
- Numbers whose base-5 representation contains exactly three 2's and two 3's.at n=18A045276
- a(n)=T(n,n+2), array T as in A049723.at n=40A049730
- a(n) = floor(A*a(n-1) + B*a(n-2) + C)/p^r, where p^r is the highest power of p dividing floor(A*a(n-1) + B*a(n-2) + C), A=1.0001, B=1.0001, C=1, p=2.at n=37A053521
- Composite numbers n such that sigma(n)+6 = sigma(n+6), where sigma=A000203.at n=5A054903
- Composite solutions to Sigma[x+d[x]] = Sigma[x]+d[x], where Sigma[] = A000203(), d[] = A000005().at n=6A063701
- Numbers n such that A003313(n) = A003313(2n).at n=15A086878
- a(n+5) = (a(n+4)*a(n+1) + 2*a(n+3)*a(n+2))/a(n).at n=11A105236
- Triangular matchstick numbers in the class of prime numbers: sum of n-th and next n primes.at n=27A105720
- Triangle read by rows: number of atomic set compositions of size n and length k (see description in A095989) 1 <= k <= n.at n=30A109062
- a(1)=1, a(2) = 2. a(n) = a(n-2) + (largest prime dividing a(n-1)).at n=50A112337
- Numbers k for which 8*k+1, 8*k+5 and 8*k+7 are primes.at n=33A123980
- a(n) = c is least number such that 10^n/2 -/+ c are primes.at n=43A124049
- a(1) = 1; for n > 1, a(n) = smallest number > a(n-1) such that pairwise sums and (absolute) differences of distinct elements are all distinct.at n=41A126428
- Expansion of g.f.: (1-x)*(1+2*x)/((1+x)*(1-3*x+x^2)).at n=9A129905
- 1/10 of the number of 10-colorings of an n X n array symmetric under 180 degree rotation.at n=2A145263
- a(n) = (1/2)*(n^3 - 6*n^2 + 13*n - 6).at n=23A158498
- a(0)=0, a(1)=1, a(n) = ( (a(n-1)+a(n-2)) XOR n) + n.at n=16A182506