961
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 3
- Divisor Sum
- 993
- Proper Divisor Sum (Aliquot Sum)
- 32
- 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
- 930
- Möbius Function
- 0
- Radical
- 31
- Omega Function (Ω)
- 2
- Little Omega Function (ω)
- 1
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
- 49
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- no
- Prime Power
- yes
- 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
Names
- German
- neunhunderteinundsechzig· ordinal: neunhunderteinundsechzigste
- English
- nine hundred sixty-one· ordinal: nine hundred sixty-first
- Spanish
- novecientos sesenta y uno· ordinal: 961º
- French
- neuf cent soixante et un· ordinal: neuf cent soixante et unième
- Italian
- novecentosessantuno· ordinal: 961º
- Latin
- nongenti sexaginta unus· ordinal: 961.
- Portuguese
- novecentos e sessenta e um· ordinal: 961º
Appears in sequences
- n followed by n^2.at n=61A000463
- Squares that are not the sum of 2 nonzero squares.at n=20A000548
- Number of permutations of [1,2,...,n] with n-1 inversions.at n=7A000707
- Numbers n such that the sum of the squares of n consecutive positive odd numbers x^2 + (x+2)^2 + ... + (x+2n-2)^2 = k^2 for some integer k. The least values of x and k for each n are in A056131 and A056132, respectively.at n=55A001033
- Squares of primes.at n=10A001248
- Perfect powers: m^k where m > 0 and k >= 2.at n=39A001597
- a(n) = floor(Pi^n).at n=6A001672
- Powerful numbers, definition (1): if a prime p divides n then p^2 must also divide n (also called squareful, square full, square-full or 2-powerful numbers).at n=50A001694
- Nearest integer to Pi^n.at n=6A002160
- Squares and cubes.at n=37A002760
- a(n) = n^2 written backwards.at n=12A002942
- Number of partitions of n into parts 5k+1 or 5k+4.at n=49A003114
- Sum of squares of primes dividing n.at n=30A005063
- Sum of squares of odd primes dividing n.at n=30A005066
- Sum of squares of odd primes dividing n.at n=61A005066
- Sum of squares of primes = 1 mod 3 dividing n.at n=61A005071
- Sum of squares of primes = 1 mod 3 dividing n.at n=30A005071
- Sum of squares of primes = 3 mod 4 dividing n.at n=61A005083
- Sum of squares of primes = 3 mod 4 dividing n.at n=30A005083
- a(n) = C(n+2,3) + C(n,3) + C(n-1,3).at n=12A006004