91
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 112
- Proper Divisor Sum (Aliquot Sum)
- 21
- 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
- 72
- Möbius Function
- 1
- Radical
- 91
- 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
- yes
- Perfect Square
- no
- Perfect Cube
- no
- Pentagonal Number
- no
- Hexagonal Number
- yes
- 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
- 92
- 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
- einundneunzig· ordinal: einundneunzigste
- English
- ninety-one· ordinal: ninety-first
- Spanish
- noventa y uno· ordinal: 91º
- French
- quatre-vingt-onze· ordinal: quatre-vingt-onzième
- Italian
- novantuno· ordinal: 91º
- Latin
- nonaginta unus· ordinal: 91.
- Portuguese
- noventa e um· ordinal: 91º
Appears in sequences
- Numbers that are not squares (or, the nonsquares).at n=81A000037
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=50A000052
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=65A000062
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=45A000069
- a(n) = 2*(3*n)! / ((2*n+1)!*(n+1)!).at n=5A000139
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=35A000203
- A Beatty sequence: floor(n*(e-1)).at n=52A000210
- Number of oriented trees with n nodes.at n=5A000238
- Number of partitions into non-integral powers.at n=3A000263
- Number of partitions into non-integral powers.at n=6A000327
- Square pyramidal numbers: a(n) = 0^2 + 1^2 + 2^2 + ... + n^2 = n*(n+1)*(2*n+1)/6.at n=6A000330
- 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=46A000379
- Hexagonal numbers: a(n) = n*(2*n-1).at n=7A000384
- Numbers that are the sum of three nonzero squares.at n=59A000408
- Numbers that are the sum of 3 but no fewer nonzero squares.at n=37A000419
- Number of isomorphism classes of connected 3-regular (trivalent, cubic) loopless multigraphs of order 2n.at n=4A000421
- The greedy sequence of integers which avoids 3-term geometric progressions.at n=67A000452
- 1 together with products of 2 or more distinct primes.at n=32A000469
- Number of steps to reach 1 in sequence A000546.at n=28A000547
- Erroneous version of A007535.at n=2A000783