5500
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 24
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 7604
- 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
- 2000
- Möbius Function
- 0
- Radical
- 110
- Omega Function (Ω)
- 6
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 41
- 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
- 9-gonal (or enneagonal or nonagonal) numbers: a(n) = n*(7*n-5)/2.at n=40A001106
- Genus of modular group Gamma(n) = genus of modular curve Chi(n).at n=51A001767
- Number of 3-voter voting schemes with n linearly ranked choices.at n=18A007009
- Number of homogeneous primitive partition identities of degree 6 with largest part n.at n=12A007344
- Coordination sequence T5 for Zeolite Code NON.at n=45A008216
- Place n distinguishable balls in n boxes (in n^n ways); let f(n,k) = number of ways that max in any box is k, for 1 <= k <= n; sequence gives f(n,n-2)/n.at n=8A019579
- a(n) = n*(n - 1)^3/2.at n=11A019582
- Even 9-gonal (or enneagonal) numbers.at n=20A028992
- Related to quintic factorial numbers A008548.at n=3A034687
- Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*11^j.at n=11A038253
- Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*5^j.at n=13A038319
- Normalized extreme values for "3x+1" trees of depth n.at n=27A045476
- A convolution triangle of numbers obtained from A034687.at n=6A049375
- a(n) = n*(2*n+5)*(n-1)/6.at n=25A051925
- Expansion of g.f. (1+x)*Product_{m>0} (1 + x^m).at n=48A052816
- Expansion of 1/(1-10*x)^10.at n=2A053109
- Numbers k such that 2^k mod phi(k) = 2^phi(k) mod k.at n=36A069050
- Numbers k such that k*rev(k) is a square different from k^2, where rev=A004086, decimal reversal.at n=27A070760
- Main diagonal of A082228.at n=37A082231
- Hypotenuses for which there exist exactly 3 distinct integer triangles.at n=30A084647