33
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- yes
- Repdigit
- yes
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 48
- Proper Divisor Sum (Aliquot Sum)
- 15
- 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
- 20
- Möbius Function
- 1
- Radical
- 33
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 26
- Smith Number
- no
Classification
- Natural
- yes
- Even
- no
- Odd
- yes
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
Names
- German
- dreiunddreißig· ordinal: dreiunddreißigste
- English
- thirty-three· ordinal: thirty-third
- Spanish
- treinta y tres· ordinal: 33º
- French
- trente-trois· ordinal: trente-troisième
- Italian
- trentatre· ordinal: 33º
- Latin
- triginta tres· ordinal: 33.
- Portuguese
- trinta e três· ordinal: 33º
Appears in sequences
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=32A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=32A000027
- Numbers that are not squares (or, the nonsquares).at n=27A000037
- a(n) = 2^n + 1.at n=5A000051
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=23A000062
- Number of positive integers <= 2^n of form x^2 + 2 y^2.at n=6A000067
- a(n) = Fibonacci(n) - 1.at n=8A000071
- Number of partitions of n if there are two kinds of 1, two kinds of 2 and two kinds of 3.at n=5A000098
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=20A000201
- a(n) = floor(n^2/3).at n=10A000212
- Remove all factors of 2 from n; or largest odd divisor of n; or odd part of n.at n=32A000265
- Remove all factors of 2 from n; or largest odd divisor of n; or odd part of n.at n=65A000265
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=14A000277
- Pentanacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) + a(n-5) with a(0) = a(1) = a(2) = a(3) = a(4) = 1.at n=8A000322
- Sums of three squares: numbers of the form x^2 + y^2 + z^2.at n=28A000378
- Numbers where total number of 1-bits in the exponents of their prime factorization is even; a 2-way classification of integers: complement of A000028.at n=15A000379
- Numbers of form x^2 + y^2 + 7z^2.at n=26A000394
- Numbers of form x^2 + 2y^2 + 2yz + 4z^2.at n=30A000398
- Numbers of form x^2 + y^2 + 2*z^2.at n=31A000401
- Numbers that are the sum of three nonzero squares.at n=16A000408