333
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- yes
- Repdigit
- yes
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 494
- Proper Divisor Sum (Aliquot Sum)
- 161
- 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
- 216
- Möbius Function
- 0
- Radical
- 111
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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
- dreihundertdreiunddreißig· ordinal: dreihundertdreiunddreißigste
- English
- three hundred thirty-three· ordinal: three hundred thirty-third
- Spanish
- trescientos treinta y tres· ordinal: 333º
- French
- trois cent trente-trois· ordinal: trois cent trente-troisième
- Italian
- trecentotrentatre· ordinal: 333º
- Latin
- trecenti triginta tres· ordinal: 333.
- Portuguese
- trezentos e trinta e três· ordinal: 333º
Appears in sequences
- Number of hexagonal polyominoes (or hexagonal polyforms, or planar polyhexes) with n cells.at n=6A000228
- Concatenate n n times.at n=2A000461
- Number of inequivalent ways to color vertices of a cube using at most n colors.at n=3A000543
- Moran numbers: k such that k/(sum of digits of k) is prime.at n=27A001101
- Number of partitions of n into at most 5 parts.at n=24A001401
- Triangle of values of 2-d recurrence.at n=58A001404
- Nearest integer to 2*n*log(n).at n=44A001618
- Number of series-reduced planted trees with n+9 nodes and 4 internal nodes.at n=8A001860
- Palindromes in base 10.at n=42A002113
- a(n) = 3*(10^n - 1)/9.at n=3A002277
- Numerators of convergents to Pi.at n=4A002485
- Numbers k such that (k^2 + k + 1)/7 is prime.at n=33A002641
- Rotatable partitions.at n=25A002722
- a(n) = Sum_{d|n, d <= 4} d^2 + 4*Sum_{d|n, d>4} d.at n=64A002791
- a(n) = nearest integer to n^(3/2).at n=48A002821
- Length of shortest (or optimal) Golomb ruler with n marks.at n=19A003022
- Number of partitions of n into parts 5k+1 or 5k+4.at n=39A003114
- Number of partially achiral trees with n nodes.at n=12A003243
- a(n) = A000201(A003234(n)) + n.at n=48A003248
- Let y=f(x) satisfy F(x,y)=0. a(n) is the number of terms in the expansion of (d/dx)^n y in terms of the partial derivatives of F.at n=6A003262