1161
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
- 8
- Divisor Sum
- 1760
- Proper Divisor Sum (Aliquot Sum)
- 599
- 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
- 756
- Möbius Function
- 0
- Radical
- 129
- 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
- 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
- 181
- 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
- Smallest nonnegative number that is the sum of 3 squares in exactly n ways.at n=13A000437
- a(n) = Sum_{k=1..n-1} k*sigma(k)*sigma(n-k).at n=8A000441
- An approximation to population of x^2 + y^2 <= 2^n.at n=12A000692
- Number of degree-n irreducible polynomials over GF(2); number of n-bead necklaces with beads of 2 colors when turning over is not allowed and with primitive period n; number of binary Lyndon words of length n.at n=14A001037
- Total height of trees with n nodes.at n=8A001853
- a(1) = 0, a(2) = -2; for n > 2, a(n) + a(n-2) - a(n-3) - a(n-5) - ... - a(n-p) = (-1)^(n+1)*n if n is prime, otherwise = 0, where p = largest prime < n.at n=42A002120
- Squares written in base 8.at n=24A002441
- The square sieve.at n=61A002960
- Number of restricted solid partitions of n.at n=13A002974
- a(n) = floor(n*phi^7), where phi is the golden ratio, A001622.at n=40A004922
- a(n) = round(n*phi^7), where phi is the golden ratio, A001622.at n=40A004942
- Sum of squares of Fibonacci numbers 1,2,3,5,... that divide n.at n=33A005093
- Number of entries in first n rows of Pascal's triangle not divisible by 3.at n=78A006048
- a(n) = 1 + n/2 + 9*n^2/2.at n=16A006137
- In the '3x+1' problem, these values for the starting value set new records for number of steps to reach 1.at n=20A006877
- Sum of the first n primes.at n=26A007504
- Coordination sequence T1 for Zeolite Code ANA.at n=22A008031
- Coordination sequence T1 for Zeolite Code KFI.at n=26A008123
- Crystal ball sequence for planar net 4.8.8.at n=29A008577
- Expansion of (1+x^7)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=42A008768