326
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 492
- Proper Divisor Sum (Aliquot Sum)
- 166
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 162
- Möbius Function
- 1
- Radical
- 326
- 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
- 24
- 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
- dreihundertsechsundzwanzig· ordinal: dreihundertsechsundzwanzigste
- English
- three hundred twenty-six· ordinal: three hundred twenty-sixth
- Spanish
- trescientos veintiséis· ordinal: 326º
- French
- trois cent vingt-six· ordinal: trois cent vingt-sixième
- Italian
- trecentoventisei· ordinal: 326º
- Latin
- trecenti viginti sex· ordinal: 326.
- Portuguese
- trezentos e vinte e seis· ordinal: 326º
Appears in sequences
- Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts.at n=25A000124
- Number of certain rooted planar maps.at n=4A000259
- Number of 4-dimensional partitions of n.at n=5A000334
- Number of partially labeled rooted trees with n nodes (3 of which are labeled).at n=2A000444
- Total number of ordered k-tuples (k=0..n) of distinct elements from an n-element set: a(n) = Sum_{k=0..n} n!/k!.at n=5A000522
- From a differential equation.at n=11A000997
- a(n) is the solution to the postage stamp problem with 4 denominations and n stamps.at n=8A001209
- a(n) = Sum_{k=0..5} (n+k)! * C(5,k).at n=1A001347
- 2 together with primes multiplied by 2.at n=38A001747
- a(1) = 0, a(2) = -2; for n > 2, a(n) + a(n-2) - a(n-3) - a(n-5) - ... - a(n-p) = (-1)^(n+1)*n if n is prime, otherwise = 0, where p = largest prime < n.at n=35A002120
- Numbers k such that (4*k^2 + 1)/5 is prime.at n=52A002732
- a(n) (n>6) is least integer > a(n-1) with precisely three representations a(n) = a(i) + a(j), 1 <= i < j < n, a(n) = n for n=1..6.at n=61A003045
- Szekeres's sequence: a(n)-1 in ternary = n-1 in binary; also: a(1) = 1, a(2) = 2, and thereafter a(n) is smallest number k which avoids any 3-term arithmetic progression in a(1), a(2), ..., a(n-1), k.at n=49A003278
- Numbers that are the sum of 6 positive 4th powers.at n=24A003340
- Numbers that are the sum of 11 positive 4th powers.at n=38A003345
- Numbers that are the sum of 11 positive 6th powers.at n=5A003367
- Inconsummate numbers in base 10: no number is this multiple of the sum of its digits (in base 10).at n=14A003635
- Numbers k such that cos(k-1) <= 0 and cos(k) > 0.at n=51A004083
- a(n) = 100*log(n) rounded to nearest integer.at n=25A004238
- a(n) = ceiling(100*log(n)).at n=25A004239