3113
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 3408
- Proper Divisor Sum (Aliquot Sum)
- 295
- 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
- 2820
- Möbius Function
- 1
- Radical
- 3113
- Omega Function (Ω)
- 2
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 92
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Number of partitions of n into Fibonacci parts (with a single type of 1).at n=48A003107
- Describe the previous term! (method A - initial term is 3).at n=3A006715
- Coordination sequence T2 for Zeolite Code MOR.at n=36A008183
- Carlitz-Riordan q-Catalan numbers (recurrence version) for q=2.at n=5A015083
- Coordination sequence T3 for Zeolite Code CZP.at n=36A019458
- Fibonacci sequence beginning 1, 21.at n=12A022391
- Conjectured number of irreducible multiple zeta values of depth 7 and weight 2n+19.at n=14A022495
- Describe the previous term! (method B - initial term is 3).at n=3A022499
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (odd natural numbers), t = A000201 (lower Wythoff sequence).at n=21A025113
- Palindromes whose digits do not appear in previous term.at n=30A030285
- Numbers having only digits 1 and 3 in their decimal representation.at n=23A032917
- Numbers with multiplicative digital root value 9.at n=16A034056
- Decimal part of cube root of a(n) starts with 6: first term of runs.at n=12A034132
- Nonprime; becomes prime if any digit is deleted (zeros not allowed in the number).at n=39A034304
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 4 (mod 5).at n=40A035568
- Numbers whose maximal base-6 run length is 4.at n=21A037987
- Base-10 palindromes that starts with 3.at n=13A043038
- a(n)=(s(n)+2)/8, where s(n)=n-th base 8 palindrome that starts with 6 (in base 8), written in decimal digits.at n=23A043070
- Numbers having four 2's in base 6.at n=12A043380
- Numbers k such that the string 3,8 occurs in the base 9 representation of k but not of k-1.at n=42A044286