1665
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 2964
- Proper Divisor Sum (Aliquot Sum)
- 1299
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 864
- Möbius Function
- 0
- Radical
- 555
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 179
- 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
- no
- Odd
- yes
Appears in sequences
- Generalized Stirling numbers, [n+3,n]_2.at n=4A001702
- Generalized Stirling numbers, [n+5,5]_2.at n=3A001707
- a(n) = floor(n(n+2)(2n+1)/8).at n=18A002717
- Centered tetrahedral numbers.at n=13A005894
- a(n) = Fibonacci(n)*2^n + 1.at n=7A006483
- a(n) = (n^4 + n^2 + 2*n)/4.at n=9A006528
- Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.at n=35A007664
- Expansion of (1+x^2)(1+x^4)/((1-x)^2*(1-x^2)*(1-x^3)).at n=24A007979
- Coordination sequence T1 for Zeolite Code LAU.at n=29A008124
- Expansion of (1+x^8)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=48A008769
- Expansion of e.g.f. log(1+x)/exp(sin(x)).at n=7A009436
- Coordination sequence T3 for Zeolite Code -PAR.at n=29A009857
- a(n) = floor( n*(n-1)*(n-2)/28 ).at n=37A011910
- Number of 8's in all the partitions of n into distinct parts.at n=53A015743
- Number of partitions of n into distinct parts, none being 8.at n=46A015755
- Positive integers n such that 2^n (mod n) == 2^9 (mod n).at n=70A015931
- a(n) = floor( Gamma(n+5/8)/Gamma(5/8) ).at n=7A020071
- Pseudoprimes to base 73.at n=28A020201
- a(n) = 3rd Euler polynomial evaluated at 2^n and multiplied by 4.at n=3A020523
- Positive numbers k such that k and 3*k are anagrams in base 7 (written in base 7).at n=8A023069