5201
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5952
- Proper Divisor Sum (Aliquot Sum)
- 751
- 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
- 4452
- Möbius Function
- 1
- Radical
- 5201
- 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
- 147
- 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
- a(n) = n^3 + n^2 - 1.at n=16A003777
- Number of strict 5th-order maximal independent sets in cycle graph.at n=48A007393
- a(n) = n*(n-1) + (n-2)*(n-3) + ... + 1*0 + 1 for n odd; otherwise, a(n) = n*(n-1) + (n-2)*(n-3) + ... + 2*1.at n=30A014112
- Number of balls in pyramid with base either a regular hexagon or a hexagon with alternate sides differing by 1 (balls in hexagonal pyramid of height n taken from hexagonal close-packing).at n=27A019298
- Numbers k such that the continued fraction for sqrt(k) has period 66.at n=18A020405
- Numbers k such that Fib(k) == -13 (mod k).at n=20A023167
- Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=20A024850
- Numbers whose set of base-8 digits is {1,2}.at n=40A032929
- Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,1,0.at n=6A033131
- Number of partitions of n with equal number of parts congruent to each of 0 and 4 (mod 5).at n=36A035555
- Base 8 digits are, in order, the first n terms of the periodic sequence with initial period 1,2.at n=4A037485
- Bisection of A028289.at n=39A038390
- Sums of 5 distinct powers of 4.at n=13A038473
- Numerators of continued fraction convergents to sqrt(26).at n=3A041040
- Numerators of continued fraction convergents to sqrt(104).at n=3A041186
- Numerators of continued fraction convergents to sqrt(234).at n=7A041436
- Numerators of continued fraction convergents to sqrt(416).at n=7A041790
- Numerators of continued fraction convergents to sqrt(650).at n=3A042248
- Numerators of continued fraction convergents to sqrt(936).at n=7A042810
- Base-8 palindromes that start with 1.at n=35A043021