3670
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 6624
- Proper Divisor Sum (Aliquot Sum)
- 2954
- 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
- 1464
- Möbius Function
- -1
- Radical
- 3670
- 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
- 131
- 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
- Expansion of 1/(1-x^6-x^7-x^8-x^9-x^10-x^11-x^12-x^13-x^14-x^15).at n=43A017855
- Powers of fifth root of 13 rounded to nearest integer.at n=16A018151
- Powers of fifth root of 13 rounded up.at n=16A018152
- a(n) = prime(2^n)-1.at n=9A018249
- Expansion of 1/((1-x)*(1-3*x)*(1-7*x)*(1-10*x)).at n=3A021604
- Numbers k such that 103*2^k+1 is prime.at n=10A032401
- Coordination sequence T1 for Zeolite Code SFF.at n=40A038437
- Triangle read by rows: T(n,k) gives number of r-bicoverings of an n-set with k blocks, n >= 2, k = 3..n+floor(n/2).at n=15A060052
- Integer part of log(n^n)^log(1 + log(n)).at n=46A062433
- G.f.: (x+4*x^3+x^5)/((1-x)^2*(1-x^2)^2*(1-x^3)).at n=19A083707
- a(n) = A052217(n)/3.at n=27A088405
- Sum of smallest parts (counted with multiplicity) of all partitions of n.at n=20A092309
- Number of squares on infinite half chessboard at <=n knight moves from a fixed point on the diagonal.at n=23A098499
- Numbers k such that 4^k*(2^k - 1) + 1 is a prime.at n=6A098856
- Positive numbers that are not the sum of a triangular number, a nonnegative cube and a positive Fibonacci number.at n=31A115177
- Number of partitions of {1,...,n} into blocks such that no block size is repeated more than 3 times.at n=8A115275
- Number of permutations of length n which avoid the patterns 1234, 2431, 4213.at n=9A116813
- Number of DD's in all skew Dyck paths of semilength n.at n=7A128740
- Number of freely-braided hexagon-avoiding permutations in S_n; the freely-braided hexagon-avoiding permutations are those that avoid 3421, 4231, 4312, 4321, 46718235, 46781235, 56718234 and 56781234.at n=8A129777
- Sum of staircase twin primes according to the rule: top * bottom + next top.at n=6A135286