3356
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 17
- Digital Root
- 8
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 5880
- Proper Divisor Sum (Aliquot Sum)
- 2524
- 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
- 1676
- Möbius Function
- 0
- Radical
- 1678
- Omega Function (Ω)
- 3
- 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
- 87
- 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
- Numbers k such that 4!*(2k-5)!/(k!*(k-1)!) is an integer.at n=25A004784
- 5!(2n-6)!/n!(n-1)! is an integer.at n=30A004785
- Coordination sequence T1 for Zeolite Code LEV.at n=43A008127
- Phi(n) + 5 | sigma(n + 5).at n=36A015784
- Powers of cube root of 21 rounded down.at n=8A018036
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite EUO = EU-1 Nan[AlnSi112-nO224] starting with a T7 atom.at n=11A019126
- Expansion of tanh(sin(x)*x)/2.at n=4A024243
- a(n) = n*(n^2 + 12*n - 25)/6.at n=24A026057
- "BHK" (reversible, identity, unlabeled) transform of 0,1,1,1...at n=20A032090
- Numbers having four 1's in base 5.at n=32A043356
- Numbers k such that the string 3,8 occurs in the base 9 representation of k but not of k-1.at n=46A044286
- Numbers n such that string 5,6 occurs in the base 10 representation of n but not of n-1.at n=36A044388
- Numbers n such that string 5,6 occurs in the base 10 representation of n but not of n+1.at n=36A044769
- Triangle of numbers a(n,k) = number of Young tableaux with n cells and k rows (1 <= k <= n); also number of self-inverse permutations on n letters in which the length of the longest scattered (i.e., not necessarily contiguous) increasing subsequence is k.at n=48A047884
- Numbers k such that k and k+1 both have 6 divisors.at n=36A049103
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049687.at n=31A049688
- a(n)=T(n,n+1), array T as in A049723.at n=32A049729
- Convolution of A000010 with itself.at n=37A065093
- Number of inequivalent (ordered) solutions to n^2 = sum of 6 squares of integers >= 0.at n=50A065460
- Binary representation of base-(i-1) expansion of n: replace i-1 with 2 in base-(i-1) expansion of n.at n=46A066321