963
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 1404
- Proper Divisor Sum (Aliquot Sum)
- 441
- 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
- 636
- Möbius Function
- 0
- Radical
- 321
- Omega Function (Ω)
- 3
- 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
- 49
- 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
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- neunhundertdreiundsechzig· ordinal: neunhundertdreiundsechzigste
- English
- nine hundred sixty-three· ordinal: nine hundred sixty-third
- Spanish
- novecientos sesenta y tres· ordinal: 963º
- French
- neuf cent soixante-trois· ordinal: neuf cent soixante-troisième
- Italian
- novecentosessantatre· ordinal: 963º
- Latin
- nongenti sexaginta tres· ordinal: 963.
- Portuguese
- novecentos e sessenta e três· ordinal: 963º
Appears in sequences
- From a differential equation.at n=12A000997
- A self-generating sequence: a(1)=1, a(2)=2, a(n+1) chosen so that a(n+1)-a(n-1) is the first number not obtainable as a(j)-a(i) for 1<=i<j<=n.at n=35A001149
- Double-bitters: only even length runs in binary expansion.at n=25A001196
- a(n) = a(n-1) + a(n-2) - a(n-3).at n=37A002798
- Numbers that are the sum of 4 nonzero 4th powers.at n=46A003338
- Number of 2-factors in D_4 X P_n.at n=5A003758
- Sums of distinct nonzero 4th powers.at n=28A003999
- Inverse Moebius transform applied twice to squares.at n=30A007433
- Sum of the first n primes.at n=24A007504
- Coordination sequence T1 for Zeolite Code LEV.at n=23A008127
- a(n) is the concatenation of n and 7n.at n=8A009441
- Coordination sequence T2 for Zeolite Code -CLO.at n=27A009851
- Coordination sequence for sigma-CrFe, Position Xa.at n=8A009962
- a(0) = 1, a(n) = n^2 + 2 for n > 0.at n=31A010000
- a(n) = floor( n*(n-1)*(n-2)/28 ).at n=31A011910
- Least d such that period of continued fraction for sqrt(d) contains n (n^2+2 if n odd, (n/2)^2+1 if n even).at n=30A013945
- a(n) = -1 + Sum_{i=1..n} phi(i).at n=55A015614
- Quadruples of different integers from [ 2,n ] with no common factors between pairs.at n=22A015628
- Positive integers n such that 2^n (mod n) == 2^9 (mod n).at n=50A015931
- Powers of cube root of 19 rounded down.at n=7A018030