3150
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 9672
- Proper Divisor Sum (Aliquot Sum)
- 6522
- 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
- 720
- Möbius Function
- 0
- Radical
- 210
- Omega Function (Ω)
- 6
- 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
- 61
- 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
- Let A(n) = #{(i,j,k): i^2 + j^2 + k^2 <= n}, V(n) = (4/3)Pi*n^(3/2), P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=31A000092
- a(n) = (5*n)!/((2*n)!*(2*n)!*n!).at n=2A001459
- Triangle of coefficients of Bessel polynomials (exponents in decreasing order).at n=32A001497
- Triangle a(n,k) (n >= 0, 0 <= k <= n) of coefficients of Bessel polynomials y_n(x) (exponents in increasing order).at n=31A001498
- Coefficients of Bessel polynomials y_n (x).at n=3A001880
- a(n) = binomial(2*n+1,n)*(n+1)^2.at n=4A002544
- Number of nonseparable tree-rooted planar maps with n + 3 edges and 4 vertices.at n=3A006412
- Number of nonseparable tree-rooted planar maps with n + 4 edges and 5 vertices.at n=2A006413
- Expansion of (1+x^2) / ( (1-x)^2 * (1-x^3)^2 ).at n=41A006501
- a(0) = a(1) = 0; for n >= 2, a(n)*2^(n+2) + 1 is the smallest prime factor of the n-th Fermat number F(n) = 2^(2^n) + 1.at n=16A007117
- E-trees with at most 2 colors.at n=7A007141
- Coordination sequence T1 for Zeolite Code AEL.at n=37A008004
- Coordination sequence T1 for Zeolite Code AWW.at n=40A008045
- Coordination sequence T4 for Zeolite Code LTN.at n=39A008143
- a(n) = floor(n/4)*floor((n+1)/4)*floor((n+2)/4).at n=59A008218
- Expansion of cos(log(1+x)*cosh(x)).at n=7A009029
- Expansion of e.g.f.: sech(sech(x)*log(x+1))=1-1/2!*x^2+3/3!*x^3+6/4!*x^4-60/5!*x^5...at n=7A012877
- Expansion of e.g.f. exp(arctanh(x)+log(x+1)).at n=7A013155
- Number of partitions of n into distinct parts, none being 7.at n=52A015754
- Numbers whose base-5 representation is the juxtaposition of two identical strings.at n=24A020333