968
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 23
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 1995
- Proper Divisor Sum (Aliquot Sum)
- 1027
- 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
- 440
- Möbius Function
- 0
- Radical
- 22
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 98
- 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
- yes
- Achilles Number
- yes
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- neunhundertachtundsechzig· ordinal: neunhundertachtundsechzigste
- English
- nine hundred sixty-eight· ordinal: nine hundred sixty-eighth
- Spanish
- novecientos sesenta y ocho· ordinal: 968º
- French
- neuf cent soixante-huit· ordinal: neuf cent soixante-huitième
- Italian
- novecentosessantotto· ordinal: 968º
- Latin
- nongenti sexaginta octo· ordinal: 968.
- Portuguese
- novecentos e sessenta e oito· ordinal: 968º
Appears in sequences
- a(n) = ceiling(n^2/2).at n=44A000982
- a(n) = 2*n^2.at n=22A001105
- 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=51A001694
- Numbers in which every digit contains at least one loop (version 1).at n=54A001743
- Number of points on y^2 + xy = x^3 + x^2 + x over GF(2^n).at n=9A002248
- a(n) = 2^n - 1 - n*(n+1)/2.at n=10A002662
- Number of integer points in a certain quadrilateral scaled by a factor of n.at n=46A002789
- A nonlinear recurrence.at n=28A003073
- Numbers of the form 2^i * 11^j.at n=20A003596
- Theta series of D_4 lattice with respect to deep hole.at n=40A005879
- Number of paraffins.at n=15A005998
- a(n) = Sum_{k=1..n-1} k XOR n-k.at n=39A006582
- Number of caskets of order n.at n=7A006901
- Numbers k such that sigma(x) = k has exactly 3 solutions.at n=24A007372
- a(n) = floor(n^2/2).at n=44A007590
- Number of non-Abelian metacyclic groups of order 2^n.at n=30A007982
- Coordination sequence T1 for Zeolite Code BOG.at n=22A008049
- Coordination sequence T3 for Zeolite Code THO.at n=22A008240
- Multiples of 22.at n=44A008604
- a(n) = Sum_{k=0..7} binomial(n,k).at n=10A008860