5200
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 30
- Divisor Sum
- 13454
- Proper Divisor Sum (Aliquot Sum)
- 8254
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 1920
- Möbius Function
- 0
- Radical
- 130
- Omega Function (Ω)
- 7
- 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
- 28
- 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
- yes
- Odd
- no
Appears in sequences
- Number of permutations p on the set [n] with the properties that abs(p(i)-i) <= 3 for all i and p(1) <= 3.at n=9A002527
- a(n) = binomial(n+3, 3)/4 for odd n, n*(n+2)*(n+4)/24 for even n.at n=48A006918
- a(n) = 2*binomial(n,3).at n=26A007290
- Coordination sequence T2 for Zeolite Code NES.at n=46A008206
- Multiplicity of K_3 in K_n.at n=52A014557
- Least term in period of continued fraction for sqrt(n) is 9.at n=7A031433
- Total number of possible knight moves on an (n+2) X (n+2) chessboard, if the knight is placed anywhere.at n=25A035008
- Sums of 4 distinct powers of 4.at n=30A038472
- Base-9 palindromes that start with 7.at n=12A043034
- Numbers whose base-4 representation contains exactly three 0's and four 1's.at n=15A045032
- Partial sums of A045618.at n=7A045889
- a(n)^3 is smallest cube containing exactly n 0's.at n=8A048365
- Composites whose sum of digits equals number of its prime factors, with multiplicity.at n=30A050689
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 2 skipped primes.at n=38A050769
- Numbers n such that 293*2^n-1 is prime.at n=10A050905
- Numbers k such that k^10 == 1 (mod 11^3).at n=38A056085
- Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.at n=20A065159
- Numbers k such that k divides Sum_{i=1..k} gcd(k,i) = A018804(k).at n=34A066862
- Total number of odd parts in all partitions of n.at n=21A066897
- Smallest k > 0 with gcd(k, rev(k)) = n, where rev(k) is digit reversal of k, or 0 if no such k exists.at n=24A069554