3116
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 5880
- Proper Divisor Sum (Aliquot Sum)
- 2764
- 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
- 1440
- Möbius Function
- 0
- Radical
- 1558
- Omega Function (Ω)
- 4
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 61
- 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
- Describe the previous term! (method A - initial term is 6).at n=3A001143
- Numbers whose base-3 representation is the juxtaposition of two identical strings.at n=37A020331
- Numbers whose base-9 representation is the juxtaposition of two identical strings.at n=37A020337
- a(n) is the position of square of n-th prime among the powers of primes (A000961).at n=38A024624
- a(n) = least m such that if r and s in {1/1, 1/3, 1/5, ..., 1/(2n-1)} satisfy r < s, then r < k/m < (k+4)/m < s for some integer k.at n=18A024847
- [ Sum{(sqrt(j+1)-sqrt(i+1))^3} ], 1 <= i < j <= n.at n=28A025223
- a(n) = number of integer strings s(0),...,s(n) counted by array T in A026386 that have s(n)=0; also a(n) = T(2n,n).at n=5A026387
- T(n,[ n/2 ]), where T is the array in A026386.at n=11A026392
- Number of compositions (ordered partitions) of n into distinct odd parts.at n=42A032021
- Numbers whose set of base-6 digits is {2,3}.at n=32A032806
- Number of partitions of n with equal number of parts congruent to each of 0 and 3 (mod 4).at n=35A035542
- Numbers k such that k-th and (k+1)-st term of A038593 differ by 10.at n=42A038641
- Numbers having four 2's in base 6.at n=13A043380
- Numbers k such that the string 1,6 occurs in the base 10 representation of k but not of k-1.at n=34A044348
- Numbers n such that string 1,6 occurs in the base 10 representation of n but not of n+1.at n=34A044729
- Numbers whose base-4 representation contains exactly three 0's and two 3's.at n=31A045078
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A048149.at n=31A049713
- Numbers n such that 213*2^n-1 is prime.at n=24A050858
- Numbers k such that k*2^m-1 is prime for exactly one exponent m in the range 0<=m<=k.at n=34A061157
- Largest leg in right triangle with relatively prime sides and hypotenuse 5^n.at n=4A067312