2670
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 6480
- Proper Divisor Sum (Aliquot Sum)
- 3810
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 704
- Möbius Function
- 1
- Radical
- 2670
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 146
- 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
- Convolution of A000203 with itself.at n=17A000385
- Number of commutative elements in Coxeter group E_n.at n=4A003822
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes that is non-deficient.at n=34A007684
- Prime(n)*...*prime(a(n)) is the least product of consecutive primes which is abundant.at n=34A007707
- Coordination sequence T2 for Zeolite Code ATV.at n=33A008044
- Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay).at n=38A008610
- a(1) = 1; a(n+1) = floor((sum{k=1 to n} a(k)^3)^(1/3)).at n=42A016085
- Multiply by 1, add 1, multiply by 2, add 2, etc., start with 1.at n=11A019464
- Fibonacci sequence beginning 0, 30.at n=11A022364
- a(n) = s(1)*s(n) + s(2)*s(n-1) + ... + s(k)*s(n+1-k), where k = floor((n+1)/2), s = (odd natural numbers).at n=19A024598
- a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = floor(n/2), s = (odd natural numbers).at n=18A025112
- Number of unordered sets a, b, c, d of distinct integers from 1..n such that a+b+c+d = 0 (mod n).at n=41A032801
- Number of partitions of n into parts not of form 4k+2, 24k, 24k+3 or 24k-3. Also number of partitions in which no odd part is repeated, with 1 part of size less than or equal to 2 and where differences between parts at distance 5 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=42A036030
- Numbers n such that string 8,6 occurs in the base 9 representation of n but not of n-1.at n=35A044329
- Numbers n such that string 6,7 occurs in the base 10 representation of n but not of n-1.at n=29A044399
- Numbers n such that string 7,0 occurs in the base 10 representation of n but not of n-1.at n=28A044402
- Numbers n such that string 8,6 occurs in the base 9 representation of n but not of n+1.at n=35A044710
- Numbers n such that string 7,0 occurs in the base 10 representation of n but not of n+1.at n=28A044783
- Numbers whose base-4 representation contains no 0's and exactly four 2's.at n=33A045041
- Numbers whose base-4 representation contains exactly one 1 and four 2's.at n=34A045094