196
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
- 9
- Divisor Sum
- 399
- Proper Divisor Sum (Aliquot Sum)
- 203
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- yes
Derived Values
- Euler's Totient
- 84
- Möbius Function
- 0
- Radical
- 14
- Omega Function (Ω)
- 4
- 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
- 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
- 26
- 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
- no
- Perfect Power
- yes
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- einshundertsechsundneunzig· ordinal: einshundertsechsundneunzigste
- English
- one hundred ninety-six· ordinal: one hundred ninety-sixth
- Spanish
- ciento noventa y seis· ordinal: 196º
- French
- cent quatre-vingt-seize· ordinal: cent quatre-vingt-seizième
- Italian
- centonovantasei· ordinal: 196º
- Latin
- centum nonaginta sex· ordinal: 196.
- Portuguese
- cento e noventa e seis· ordinal: 196º
Appears in sequences
- Expansion of e.g.f. exp(x*exp(x)).at n=5A000248
- n followed by n^2.at n=27A000463
- Number of steps to reach 1 in sequence A000546.at n=34A000547
- Squares that are not the sum of 2 nonzero squares.at n=10A000548
- Invertible Boolean functions of n variables.at n=2A000724
- Genus of complete graph on n nodes.at n=51A000933
- Number of one-sided polyominoes with n cells.at n=7A000988
- Powers of 14.at n=2A001023
- 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=15A001033
- Numbers m such that Sum_{k=0..m-1} exp(2*Pi*i*k^3/m) != 0.at n=52A001074
- Number of board-pile polyominoes with n cells.at n=5A001169
- a(n) = solution to the postage stamp problem with n denominations and 2 stamps.at n=22A001212
- Squares of Catalan numbers.at n=4A001246
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.at n=30A001263
- Triangle of Narayana numbers T(n,k) = C(n-1,k-1)*C(n,k-1)/k with 1 <= k <= n, read by rows. Also called the Catalan triangle.at n=33A001263
- Winning moves in Fibonacci nim.at n=33A001581
- Perfect powers: m^k where m > 0 and k >= 2.at n=18A001597
- The partition function G(n,4).at n=6A001681
- 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=20A001694
- Genus of modular group Gamma(n) = genus of modular curve Chi(n).at n=17A001767