696
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 21
- Digital Root
- 3
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 1800
- Proper Divisor Sum (Aliquot Sum)
- 1104
- 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
- 224
- Möbius Function
- 0
- Radical
- 174
- Omega Function (Ω)
- 5
- 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
- no
- Narcissistic Number
- no
- Collatz Steps
- 33
- 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
- yes
- Odd
- no
Names
- German
- sechshundertsechsundneunzig· ordinal: sechshundertsechsundneunzigste
- English
- six hundred ninety-six· ordinal: six hundred ninety-sixth
- Spanish
- seiscientos noventa y seis· ordinal: 696º
- French
- six cent quatre-vingt-seize· ordinal: six cent quatre-vingt-seizième
- Italian
- seicentonovantasei· ordinal: 696º
- Latin
- sescenti nonaginta sex· ordinal: 696.
- Portuguese
- seiscentos e noventa e seis· ordinal: 696º
Appears in sequences
- Number of discordant permutations.at n=1A000565
- a(n) = 6*a(n-1) - a(n-2) + 2 with a(0) = 0, a(1) = 3.at n=4A001652
- Numbers in which every digit contains at least one loop (version 1).at n=29A001743
- Related to Zarankiewicz's problem.at n=35A001841
- Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010.at n=47A002088
- Numbers k such that 2*3^k + 1 is prime.at n=17A003306
- a(n) = C(n,1) + C(n,2) + C(n,3), or n*(n^2 + 5)/6.at n=16A004006
- a(n) = floor(Fibonacci(n)/6).at n=19A004699
- a(n) = floor(n*phi^7), where phi is the golden ratio, A001622.at n=24A004922
- a(n) = 1 + Sum_{i=1..n} (n-i+1)*phi(i).at n=18A005598
- Expansion of x*(1+x-x^2)/((1-x)^4*(1+x)).at n=18A005744
- a(n) = 3 + n/2 + 7*n^2/2.at n=14A006124
- a(n+1) = a(n)-th composite number, with a(0) = 1.at n=16A006508
- Trails of length n on honeycomb lattice.at n=9A006851
- Coordination sequence T1 for Zeolite Code FAU.at n=22A008105
- Coordination sequence T1 for Zeolite Code YUG.at n=17A008247
- Multiples of 24.at n=29A008606
- Molien series for Weyl group F_4.at n=60A008670
- Expansion of (1+x^12)/((1-x)*(1-x^2)*(1-x^3)*(1-x^4)).at n=37A008773
- Aliquot sequence starting at 276.at n=2A008892