1170
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
- 24
- Divisor Sum
- 3276
- Proper Divisor Sum (Aliquot Sum)
- 2106
- 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
- 288
- Möbius Function
- 0
- Radical
- 390
- 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
- 57
- 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); A000092 gives values of n where |P(n)| sets a new record; sequence gives (nearest integer to, I believe) P(A000092(n)).at n=35A000223
- Number of binary necklaces of length n with no subsequence 00, excluding the necklace "0".at n=20A000358
- Number of labeled rooted trees of height 2 with n nodes.at n=3A000551
- a(n) = floor(2^n / n).at n=13A000799
- 4-dimensional figurate numbers: a(n) = (5*n-1)*binomial(n+2,3)/4.at n=8A002418
- Glaisher's function H'(4n+1) (18 squares version).at n=14A002610
- Numbers k such that (k^2 + k + 1)/19 is prime.at n=34A002643
- Number of n-level ladder expressions with A001622.at n=10A003006
- Number of Hamiltonian rooted triangulations with n internal nodes and 3 external nodes.at n=4A003122
- Number of trees on n labeled vertices with degree at most 3.at n=5A003692
- Number of Hamiltonian cycles in W_4 X P_n.at n=4A003765
- Number of 2n-step polygons on honeycomb.at n=9A005396
- a(n) is the sum of products of terms in all partitions of n.at n=11A006906
- Sum of divisors of superabundant numbers (A004394).at n=12A007626
- Coordination sequence T1 for Zeolite Code MEL.at n=22A008150
- Coordination sequence T2 for Zeolite Code NES.at n=22A008206
- Coordination sequence T2 for Zeolite Code PAU.at n=25A008220
- Coordination sequence T3 for Zeolite Code PAU.at n=25A008221
- Coordination sequence T5 for Zeolite Code PAU.at n=25A008223
- Expansion of Jacobi theta constant theta_2^6 /(64q^(3/2)).at n=23A008440