3220
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
- 24
- Divisor Sum
- 8064
- Proper Divisor Sum (Aliquot Sum)
- 4844
- 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
- 1056
- Möbius Function
- 0
- Radical
- 1610
- Omega Function (Ω)
- 5
- 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
- 22
- 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
- a(n) = round(n*phi^12), where phi is the golden ratio, A001622.at n=10A004947
- a(n) = ceiling(n*phi^12), where phi is the golden ratio, A001622.at n=10A004967
- Coordination sequence T5 for Zeolite Code MTW.at n=37A008200
- Coordination sequence T2 for Zeolite Code RTH.at n=39A009894
- Coordination sequence T2 for Zeolite Code WEI.at n=41A009918
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A001950 (upper Wythoff sequence).at n=15A024475
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A001950 (upper Wythoff sequence).at n=14A025095
- Four times second pentagonal numbers: a(n) = 2*n*(3*n+1).at n=23A033580
- Second 10-gonal (or decagonal) numbers: n*(4*n+3).at n=28A033954
- Denominators of continued fraction convergents to sqrt(209).at n=7A041389
- Numerators of continued fraction convergents to sqrt(812).at n=2A042566
- Numbers n such that string 2,0 occurs in the base 10 representation of n but not of n-1.at n=36A044352
- Numbers n such that string 2,2 occurs in the base 10 representation of n but not of n-1.at n=32A044354
- Numbers n such that string 2,0 occurs in the base 10 representation of n but not of n+1.at n=36A044733
- Numbers whose base-5 representation contains exactly three 0's and one 3.at n=40A045200
- Numbers whose base-5 representation contains exactly three 0's and one 4.at n=36A045215
- Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 5 skipped primes.at n=32A050772
- Number of bipartite graphs with 3 edges on nodes {1..n}.at n=8A053526
- Numbers m such that 6*m+1 is a perfect square.at n=46A062717
- Multiples of 7 whose sum of digits is equal to 7.at n=14A063416