1112
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
- 2100
- Proper Divisor Sum (Aliquot Sum)
- 988
- 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
- 552
- Möbius Function
- 0
- Radical
- 278
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 44
- 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
- Conjecturally largest even integer which is an unordered sum of two primes in exactly n ways.at n=16A000954
- Primes in ternary.at n=12A001363
- To get the 6th term, for example, note that 5th term has three (10 in ternary!) 1's, one (1) 0, etc., giving 10 1 1 0 1 2 2 1 1 2.at n=2A001389
- a(n) = n concatenated with n + 1.at n=10A001704
- Primes written in base 5.at n=36A004679
- a(n)=least number m such that m-a(n-1)<>a(j)-a(k) for all j,k less than m; a(1)=1, a(2)=3.at n=32A004979
- Summarize the previous term (digits in increasing order), starting with a(1) = 1.at n=3A005151
- Representation degeneracies for Ramond strings.at n=10A005306
- Describe previous term from the right (method A - initial term is 1).at n=3A006711
- Describe the previous term! (method A - initial term is 2).at n=2A006751
- Numbers in base 3.at n=41A007089
- Numbers k such that phi(x) = k has exactly 3 solutions.at n=41A007367
- Numbers that are divisible by the product of their digits.at n=35A007602
- Numbers that contain only 1's and 2's. Nonempty binary strings of length n in lexicographic order.at n=15A007931
- Numbers that contain only 1's, 2's and 3's.at n=40A007932
- Expansion of (x^6-x^5-x^4+2x^2)/((1-x^3)(1-x^2)^2(1-x)).at n=38A007988
- Coordination sequence T3 for Zeolite Code AEL.at n=22A008006
- Coordination sequence T4 for Zeolite Code AFO.at n=22A008018
- Coordination sequence T2 for Zeolite Code NAT.at n=22A008204
- E.g.f.: -tan(log(cos(x))), even powers only.at n=4A012001