5510
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 10800
- Proper Divisor Sum (Aliquot Sum)
- 5290
- 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
- 2016
- Möbius Function
- 1
- Radical
- 5510
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 160
- 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
- Coordination sequence T1 for Zeolite Code EPI.at n=46A008090
- a(0) = 1, a(n) = 17*n^2 + 2 for n>0.at n=18A010007
- a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n-k+1), where k = floor(n/2), s = (natural numbers), t = (natural numbers >= 3).at n=37A024854
- Numbers whose set of base-12 digits is {2,3}.at n=24A032812
- Sum of distances between greatest-part-order and length-order of partitions of n.at n=14A036051
- Least number k such that floor( k / digit reversal of k ) = n.at n=34A068779
- Squarefree numbers having exactly three prime gaps.at n=23A073489
- Numbers having exactly three prime gaps in their factorization.at n=27A073495
- Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).at n=28A088003
- Triangle read by rows: T(n,k) is the number of Dyck n-paths with k large components, 0 <= k <= n/2.at n=32A097877
- (p*q - 1)/2 where p and q are consecutive odd primes.at n=25A102770
- Numbers k such that 3*10^k + 4*R_k + 5 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=17A102970
- Matrix inverse of triangle A099602, read by rows, where row n of A099602 equals the inverse binomial transform of column n of the triangle of trinomial coefficients (A027907).at n=59A104495
- A (twin's digits) self-disappearing sequence.at n=34A108988
- Where records occur in A111229.at n=46A111271
- Numbers that are the least element of a k-cycle (k > 1) of permutation A113821.at n=11A115641
- Numbers k such that k and k^2 use only the digits 0, 1, 3, 5 and 6.at n=16A136843
- Concatenation of n-th Fibonacci number and n.at n=9A139114
- a(n) = 250*n + 10.at n=21A154379
- Coefficients in the expansion of C^2/B^10, in Watson's notation of page 106.at n=5A160458