226
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 342
- Proper Divisor Sum (Aliquot Sum)
- 116
- 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
- 112
- Möbius Function
- 1
- Radical
- 226
- Omega Function (Ω)
- 2
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 13
- Smith Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- zweihundertsechsundzwanzig· ordinal: zweihundertsechsundzwanzigste
- English
- two hundred twenty-six· ordinal: two hundred twenty-sixth
- Spanish
- doscientos veintiséis· ordinal: 226º
- French
- deux cent vingt-six· ordinal: deux cent vingt-sixième
- Italian
- duecentoventisei· ordinal: 226º
- Latin
- ducenti viginti sex· ordinal: 226.
- Portuguese
- duzentos e vinte e seis· ordinal: 226º
Appears in sequences
- Let p(n, s, x) be predicate that number of occurrences of s's in x >= 2*n - the length of the longest sequence of s's in x. Then a(n)=#{x in {0,1}* | x ends in 0 and p(n,0,x) and (there is no prefix y of x such that p(n,0,y) or p(n,1,y))}.at n=3A000530
- Boustrophedon transform of triangular numbers 1,1,3,6,10,...at n=5A000718
- Number of asymmetrical planar partitions of n: planar partitions (A000219) that when regarded as 3-D objects have no symmetry.at n=11A000785
- a(n) = least m such that if a/b < c/d where a,b,c,d are integers in [0,n], then a/b < k/m < c/d for some integer k.at n=18A001000
- Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1.at n=25A001100
- A Fielder sequence.at n=9A001640
- 2 together with primes multiplied by 2.at n=30A001747
- Expansion of q^(-1/4) * (eta(q^4) / eta(q))^2 in powers of q.at n=9A001936
- a(n) = floor((n+2/3)*(5+sqrt(13))/2); v-pile positions in the 3-Wythoff game.at n=52A001960
- v-pile positions of the 4-Wythoff game with i=1.at n=43A001964
- G.f.: 1/Product_{k>=1} (1-prime(k)*x^prime(k)).at n=11A002098
- Number of unrooted hexagonal polyominoes with n cells and no reflections allowed.at n=6A002214
- a(n) = n^2 + 1.at n=15A002522
- Number of partitions into one kind of 1's, two kinds of 2's, and three kinds of 3's.at n=13A002597
- Number of terms in a skew determinant: a(n) = (A000085(n) + A081919(n))/2.at n=5A002771
- a(0) = 1; for n > 0, a(n) = a(n-1) + floor(sqrt(a(n-1))).at n=32A002984
- Number of n-node trees with a forbidden limb of length 6.at n=11A002992
- a(n) = ceiling(log_2 n!).at n=52A003070
- Value of an urn with n balls of type -1 and n+1 balls of type +1.at n=4A003126
- Endpoints in trees with n nodes.at n=8A003228