3310
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
- 5976
- Proper Divisor Sum (Aliquot Sum)
- 2666
- 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
- 1320
- Möbius Function
- -1
- Radical
- 3310
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 43
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that x^k + x + 1 is irreducible over GF(2).at n=24A002475
- Coordination sequence T3 for Zeolite Code MEL.at n=37A008152
- Coordination sequence T1 for Zeolite Code MEP.at n=34A008157
- Molien series for 6-dimensional complex reflection group 4.U_4 (3) of order 2^9 .3^7 .5.7.at n=40A008581
- Coordination sequence T3 for Zeolite Code DFO.at n=44A009877
- Coordination sequence T2 for Zeolite Code RUT.at n=38A009898
- Pseudoprimes to base 31.at n=23A020159
- Least k such that k and 4k are anagrams in base n (written in base 10).at n=26A023096
- Numbers k such that Fibonacci(k) == 55 (mod k).at n=44A023181
- Base 6 expansion uses each positive digit just once.at n=31A023744
- Expansion of 1/((1-2x)(1-3x)(1-4x)(1-11x)).at n=3A025928
- Number of partitions of n that do not contain 6 as a part.at n=29A027340
- "BHK" (reversible, identity, unlabeled) transform of 1,2,3,4,...at n=9A032099
- a(n) = floor( (Pi/e)^n ).at n=56A032739
- Every run of digits of n in base 9 has length 2.at n=38A033007
- Fibonacci-Pascal triangle read by rows.at n=61A036355
- Fibonacci-Pascal triangle read by rows.at n=59A036355
- T(n+4,4) with T as in A036355.at n=6A036683
- Numbers k such that the string 7,7 occurs in the base 9 representation of k but not of k-1.at n=40A044321
- Numbers k such that the string 1,0 occurs in the base 10 representation of k but not of k-1.at n=32A044342