3584
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 20
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 20
- Divisor Sum
- 8184
- Proper Divisor Sum (Aliquot Sum)
- 4600
- 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
- 1536
- Möbius Function
- 0
- Radical
- 14
- Omega Function (Ω)
- 10
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 25
- 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 that are not the sum of 4 nonzero squares.at n=24A000534
- Negated coefficients of Chebyshev T polynomials: [x^n](-T(n+6, x)), n >= 0.at n=6A001794
- a(n) = binomial(n,2) * 2^(n-1).at n=8A001815
- Numbers that are the sum of 7 positive 9th powers.at n=7A003396
- Numbers of form 2^i*7^j, with i, j >= 0.at n=33A003591
- Theta series of E_8 lattice with respect to deep hole.at n=5A004017
- Triangle of coefficients of Euler polynomials 2^n*E_n(x) (exponents in increasing order).at n=41A004174
- Triangle of coefficients of Euler polynomials 2^n*E_n(x) (exponents in decreasing order).at n=39A004175
- a(n) = 1000*log(n) rounded to the nearest integer.at n=35A004241
- a(n) = floor(1000*log_2(n)).at n=11A004265
- Numbers that are the sum of at most 7 positive 9th powers.at n=35A004891
- Numbers that are the sum of at most 9 positive 9th powers.at n=49A004893
- a(n) = 7*2^n.at n=9A005009
- Numbers that have a unique partition into a sum of four nonnegative squares.at n=23A006431
- a(n) = floor(n/4)*floor((n+1)/4)*floor((n+2)/4)*floor((n+3)/4).at n=31A008233
- floor(n/5)*floor((n+1)/5)*floor((n+2)/5)*floor((n+3)/5).at n=39A008381
- Aliquot sequence starting at 180.at n=39A008891
- Coordination sequence T1 for Zeolite Code -ROG.at n=45A009859
- Coordination sequence T3 for Zeolite Code RSN.at n=39A009887
- Triangle of coefficients in expansion of (1+4x)^n.at n=39A013611