3112
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 5850
- Proper Divisor Sum (Aliquot Sum)
- 2738
- 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
- 1552
- Möbius Function
- 0
- Radical
- 778
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 123
- 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
- Summarize the previous term (digits in increasing order), starting with a(1) = 1.at n=4A005151
- a(n) = 6*a(n-1) - 8.at n=4A005618
- Number of fanout-free Boolean functions of n variables using And, Or, Xor, Not, and Majority gates.at n=4A005741
- Describe the previous term! (method A - initial term is 2).at n=3A006751
- Coordination sequence T2 for Zeolite Code DDR.at n=35A008072
- Coordination sequence T1 for Zeolite Code MOR.at n=36A008182
- Coordination sequence T5 for Zeolite Code NON.at n=34A008216
- Numbers k such that phi(k) + 9 | sigma(k + 9).at n=31A015788
- Look and Say sequence: describe the previous term! (method C - initial term is 2).at n=3A023989
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (composite numbers), t = (odd natural numbers).at n=19A024590
- Coordination sequence T4 for Zeolite Code IFR.at n=39A024985
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (odd natural numbers).at n=18A025104
- (d(n)-r(n))/5, where d = A026066 and r is the periodic sequence with fundamental period (0,3,1,0,1).at n=33A026068
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 27.at n=20A031525
- Number of partitions of n into parts not of the form 19k, 19k+2 or 19k-2. Also number of partitions with 1 part of size 1 and differences between parts at distance 8 are greater than 1.at n=32A035971
- Number of partitions of n into parts not of the form 23k, 23k+4 or 23k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 10 are greater than 1.at n=29A035992
- Numbers whose maximal base-6 run length is 4.at n=20A037987
- Number of partitions satisfying cn(1,5) <= cn(0,5) and cn(4,5) <= cn(0,5).at n=36A039862
- (s(n)+7)/10, where s(n)=n-th base 10 palindrome that starts with 3.at n=33A043082
- Numbers having four 2's in base 6.at n=11A043380