93
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 128
- Proper Divisor Sum (Aliquot Sum)
- 35
- 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
- 60
- Möbius Function
- 1
- Radical
- 93
- 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
- 17
- 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
- dreiundneunzig· ordinal: dreiundneunzigste
- English
- ninety-three· ordinal: ninety-third
- Spanish
- noventa y tres· ordinal: 93º
- French
- quatre-vingt-treize· ordinal: quatre-vingt-treizième
- Italian
- novantatre· ordinal: 93º
- Latin
- nonaginta tres· ordinal: 93.
- Portuguese
- noventa e três· ordinal: 93º
Appears in sequences
- Numbers that are not squares (or, the nonsquares).at n=83A000037
- Number of n-bead necklaces with beads of 2 colors and primitive period n, when turning over is not allowed but the two colors can be interchanged.at n=11A000048
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=53A000052
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=66A000062
- Partial sums of (unordered) ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=13A000064
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=46A000069
- Cake numbers: maximal number of pieces resulting from n planar cuts through a cube (or cake): C(n+1,3) + n + 1.at n=8A000125
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=29A000134
- Lower Wythoff sequence (a Beatty sequence): a(n) = floor(n*phi), where phi = (1+sqrt(5))/2 = A001622.at n=57A000201
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=49A000203
- Number of n-node rooted trees of height 4.at n=8A000299
- a(n) = 2^(2*n+1) - binomial(2*n+1, n+1).at n=3A000346
- Number of genus 0 rooted planar maps with 4 faces and n vertices.at n=1A000365
- 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=48A000379
- Numbers that are the sum of three nonzero squares.at n=60A000408
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=38A000419
- The greedy sequence of integers which avoids 3-term geometric progressions.at n=68A000452
- 1 together with products of 2 or more distinct primes.at n=33A000469
- Number of steps to reach 1 in sequence A000546.at n=23A000547
- Number of partitions of n into distinct primes.at n=81A000586