1110
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 2736
- Proper Divisor Sum (Aliquot Sum)
- 1626
- 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
- 288
- Möbius Function
- 1
- Radical
- 1110
- 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
- 31
- 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=2A001155
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=42A001202
- To get the 3rd term, for example, note that 2nd term has three (11 in binary!) 1's and one (1) 0, giving 11 1 1 0.at n=1A001391
- Number of transpositions needed to generate permutations of length n.at n=5A001540
- Number of integral points in a certain sequence of open quadrilaterals.at n=52A002578
- Glaisher's function H'(4n+1) (18 squares version).at n=8A002610
- Least positive multiple of n written in base 4 using only 0 and 1.at n=11A004284
- Least positive multiple of n written in base 4 using only 0 and 1.at n=5A004284
- Least positive multiple of n written in base 4 using only 0 and 1.at n=13A004284
- Least positive multiple of n written in base 4 using only 0 and 1.at n=27A004284
- Least positive multiple of n written in base 7 using only 0 and 1.at n=20A004287
- Least positive multiple of n written in base 9 using only 0 and 1.at n=20A004289
- Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=29A004290
- Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=14A004290
- Least positive multiple of n that when written in base 10 uses only 0's and 1's.at n=5A004290
- Expansion of 1 / (Sum_{n=-oo..oo} x^(n^2))^5.at n=4A004406
- Representation degeneracies for Neveu-Schwarz strings.at n=13A005301
- The binary numbers (or binary words, or binary vectors, or binary expansion of n): numbers written in base 2.at n=14A007088
- Numbers in base 3.at n=39A007089
- Integers written in factorial base.at n=32A007623