3110
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 5
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5616
- Proper Divisor Sum (Aliquot Sum)
- 2506
- 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
- 1240
- Möbius Function
- -1
- Radical
- 3110
- Omega Function (Ω)
- 3
- 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
- 35
- 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
- Describe the previous term! (method A - initial term is 0).at n=3A001155
- Numbers that are the sum of 9 positive 6th powers.at n=37A003365
- Number of Boolean functions realized by cascades of n gates.at n=4A005610
- Coordination sequence T3 for Zeolite Code AFT.at n=42A008028
- Coordination sequence T1 for Zeolite Code ATT.at n=40A008041
- Coordination sequence T2 for Zeolite Code ATT.at n=40A008042
- Expansion of 1/((1-3x)*(1-5x)*(1-11x)).at n=3A017917
- Expansion of 1/((1-5x)(1-6x)(1-9x)).at n=3A019793
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=43A023181
- Numbers whose set of base-6 digits is {2,3}.at n=30A032806
- First differences give (essentially) A028242.at n=29A035107
- Summarize digits of preceding number, by decreasing digit value. Start with a(0) = 0.at n=3A036058
- Total number of prime parts in all partitions of n.at n=21A037032
- Base-6 palindromes that start with 2.at n=28A043011
- Numbers n such that string 1,1 occurs in the base 10 representation of n but not of n-1.at n=31A044343
- Numbers n such that string 1,0 occurs in the base 10 representation of n but not of n+1.at n=30A044723
- Sum of the first n palindromes (A002113).at n=32A046489
- Numbers that are repdigits in base 6.at n=22A048331
- Numbers m such that the Bernoulli number B_m has denominator 66.at n=35A051230
- Numbers k such that k!!!!!! - 1 is prime.at n=15A051592