3249
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
- 3
Divisibility
- Divisor Count
- 9
- Divisor Sum
- 4953
- Proper Divisor Sum (Aliquot Sum)
- 1704
- 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
- 2052
- Möbius Function
- 0
- Radical
- 57
- Omega Function (Ω)
- 4
- 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
- yes
- 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
- 136
- 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
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Squares that are not the sum of 2 nonzero squares.at n=34A000548
- G.f.: (1 + x^4 + x^7 + 2*x^8 + x^9 + x^12 + x^16)/Product_{i=1..8} (1 - x^i).at n=26A003405
- a(n) = (n + 3)*(n^2 + 6*n + 2)/6.at n=24A005286
- a(n) = n*(n+1)^2/2.at n=18A006002
- Numbers n such that n divides 2^n + 1.at n=11A006521
- Number of cases considered in a particular algorithm for enumerating hexaflexagrams.at n=9A007499
- Coordination sequence T7 for Zeolite Code MFI.at n=36A008170
- Squares formed by concatenating other squares, not ending in 0.at n=10A009404
- In the prime factorization of n, increment odd powers and decrement even powers (multiplicative and self-inverse).at n=56A011262
- a(n) = (F(n+1)+L(n)+n)^2 where F(n) are the Fibonacci numbers (A000045) and L(n) are the Lucas numbers (A000032).at n=7A014718
- Squares of numbers in triangle of Eulerian numbers that are not 1.at n=6A014732
- Squares of numbers in triangle of Eulerian numbers that are not 1.at n=9A014732
- Squares of odd numbers in triangle of Eulerian numbers.at n=13A014734
- Squares of odd numbers in triangle of Eulerian numbers.at n=12A014734
- Squares of odd numbers in triangle of Eulerian numbers that are not 1.at n=2A014735
- Squares of odd numbers in triangle of Eulerian numbers that are not 1.at n=3A014735
- Squares of numbers in array formed from elements to the right of middle of rows of triangle of Eulerian numbers.at n=7A014748
- Squares of numbers in array formed from elements to the right of middle of rows of triangle of Eulerian numbers that are not 1.at n=3A014749
- Squares of numbers in array formed from odd elements to the right of middle of rows of triangle of Eulerian numbers.at n=5A014756
- Squares of numbers in array formed from odd elements to the right of middle of rows of triangle of Eulerian numbers that are not 1.at n=1A014758