960
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 28
- Divisor Sum
- 3048
- Proper Divisor Sum (Aliquot Sum)
- 2088
- 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
- 256
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 8
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 23
- Smith 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
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- neunhundertsechzig· ordinal: neunhundertsechzigste
- English
- nine hundred sixty· ordinal: nine hundred sixtieth
- Spanish
- novecientos sesenta· ordinal: 960º
- French
- neuf cent soixante· ordinal: neuf cent soixantième
- Italian
- novecentosessanta· ordinal: 960º
- Latin
- nongenti sexaginta· ordinal: 960.
- Portuguese
- novecentos e sessenta· ordinal: 960º
Appears in sequences
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=54A000118
- Number of ways of writing n as a sum of 5 squares.at n=15A000132
- Number of ways of writing n as a sum of 6 squares.at n=7A000141
- Number of ways of writing n as a sum of 10 squares.at n=3A000144
- Generalized class numbers c_(n,1).at n=19A000233
- Number of switching networks under action of GL_n(Z_2) acting on 3 variables.at n=1A000818
- Jordan-Polya numbers: products of factorial numbers A000142.at n=30A001013
- Numbers k such that k / (sum of digits of k) is a square.at n=39A001102
- Smallest even number that is an unordered sum of two odd primes in exactly n ways.at n=45A001172
- Double-bitters: only even length runs in binary expansion.at n=24A001196
- Numbers k such that 3^k, 3^(k+1) and 3^(k+2) have the same number of digits.at n=44A001682
- Numbers in which every digit contains at least one loop (version 1).at n=52A001743
- Hit polynomials; convolution of natural numbers with Fibonacci numbers F(2), F(3), F(4), ....at n=11A001891
- Highly abundant numbers: numbers k such that sigma(k) > sigma(m) for all m < k.at n=42A002093
- a(n) = Sum_{d|n, d == 1 mod 4} d^2 - Sum_{d|n, d == 3 mod 4} d^2.at n=32A002173
- 4-dimensional figurate numbers: a(n) = n*binomial(n+2, 3).at n=7A002417
- Number of ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.at n=5A002566
- Expansion of (1-x)^(-3) * (1-x^2)^(-2).at n=14A002624
- Erroneous version of A047709.at n=9A002911
- The square sieve.at n=55A002960