5110
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
- 16
- Divisor Sum
- 10656
- Proper Divisor Sum (Aliquot Sum)
- 5546
- 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
- 1728
- Möbius Function
- 1
- Radical
- 5110
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 59
- 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
- yes
- Odd
- no
Appears in sequences
- Number of paraffins.at n=26A005997
- Coordination sequence T3 for Zeolite Code -CHI.at n=45A009848
- a(n) = n*(13*n + 1)/2.at n=28A022271
- a(n) = n*(n^2 + 12*n - 25)/6.at n=28A026057
- Sum of squares of numbers in row n of array T given by A026780.at n=6A027253
- a(n) = floor( (Pi/e)^n ).at n=59A032739
- a(n) = prime(n)*prime(n+1) - prime(n+1).at n=19A037167
- Base-9 palindromes that start with 7.at n=11A043034
- Expansion of 1/((1-x)^7 - x^7).at n=9A049017
- Partial sums of A051865.at n=14A050441
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 8 skipped primes.at n=36A050775
- Number of nonalternating prime knots with n crossings.at n=12A051763
- Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero.at n=9A058877
- Engel expansion of 1/e = 0.367879... .at n=35A059193
- a(n) = n*(2*n^2 - 2*n + 1).at n=14A059722
- Multiples of 7 whose sum of digits is equal to 7.at n=16A063416
- Numbers k such that phi((prime(k)-1)/2) = sigma(k).at n=26A068474
- Least number k such that floor( k / digit reversal of k ) = n.at n=43A068779
- Triangle of coefficients, read by rows of (2n+1) terms, where the n-th row forms a polynomial in x, P(n,x), of degree 2n and satisfies: P(n,x) = [Sum_{k=1..n} 1/(k + x + x^2)]*[Product_{k=1..n} (k + x + x^2)].at n=28A074248
- Largest squarefree number dividing sum of cubes of divisors of n.at n=26A080238