201
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 3
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 272
- Proper Divisor Sum (Aliquot Sum)
- 71
- 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
- 132
- Möbius Function
- 1
- Radical
- 201
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 18
- 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
- no
- Odd
- yes
Names
- German
- zweihunderteins· ordinal: zweihunderteinsste
- English
- two hundred one· ordinal: two hundred first
- Spanish
- doscientos uno· ordinal: 201º
- French
- deux cent un· ordinal: deux cent unième
- Italian
- duecentouno· ordinal: 201º
- Latin
- ducenti unus· ordinal: 201.
- Portuguese
- duzentos e um· ordinal: 201º
Appears in sequences
- a(n) = a(n-1) + a(n-2) - 2, a(0) = 4, a(1) = 3.at n=11A000211
- n written in base where place values are positive cubes.at n=55A000433
- a(n) = floor(sinh(n)).at n=6A000471
- a(n) = floor(cosh(n)).at n=6A000501
- Number of steps to reach 1 in sequence A000546.at n=31A000547
- Lucky numbers.at n=39A000959
- Moran numbers: k such that k/(sum of digits of k) is prime.at n=18A001101
- Number of partitions of n into squares.at n=62A001156
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=44A001195
- a(1)=0, a(2n) = a(n)+1, a(2n+1) = 10*a(n+1).at n=25A001202
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 20, 50 cents.at n=38A001313
- Primes in ternary.at n=7A001363
- A generalized Fibonacci sequence.at n=32A001584
- a(n) = 3 * prime(n).at n=18A001748
- Sorting numbers: number of comparisons for merge insertion sort of n elements.at n=46A001768
- Sorting numbers: maximal number of comparisons for sorting n elements by binary insertion.at n=43A001855
- v-pile counts for the 4-Wythoff game with i=2.at n=38A001966
- MacMahon's solid partitions of n in which 2 is the smallest summand.at n=6A002043
- Numbers k such that 3*2^k + 1 is prime.at n=12A002253
- ((2^m - 1) / p) mod p, where p = prime(n) and m = ord(2,p).at n=47A002323