162
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 9
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 10
- Divisor Sum
- 363
- Proper Divisor Sum (Aliquot Sum)
- 201
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- yes
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 54
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 5
- 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
- 23
- 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
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- einshundertzweiundsechzig· ordinal: einshundertzweiundsechzigste
- English
- one hundred sixty-two· ordinal: one hundred sixty-second
- Spanish
- ciento sesenta y dos· ordinal: 162º
- French
- cent soixante-deux· ordinal: cent soixante-deuxième
- Italian
- centosessantadue· ordinal: 162º
- Latin
- centum sexaginta duo· ordinal: 162.
- Portuguese
- cento e sessenta e dois· ordinal: 162º
Appears in sequences
- Generalized tangent numbers d(n,1).at n=53A000061
- Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).at n=53A000115
- Set partitions without singletons: number of partitions of an n-set into blocks of size > 1. Also number of cyclically spaced (or feasible) partitions.at n=7A000296
- Numbers that are the sum of 2 nonzero squares.at n=55A000404
- Number of bipartite partitions of n white objects and 3 black ones.at n=6A000412
- Numbers that are the sum of 2 but no fewer nonzero squares.at n=53A000415
- a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.at n=13A000423
- a(n) = 2*(2n-1)!!-(n-1)!*2^(n-1), where (2n-1)!! is A001147(n).at n=3A000779
- a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=14A000792
- Numbers that are not the sum of 4 tetrahedral numbers.at n=11A000797
- Number of primes < prime(n)^2.at n=10A000879
- a(n) = ceiling(n^2/2).at n=18A000982
- Numbers that are the sum of 2 successive primes.at n=21A001043
- a(n) = 2*n^2.at n=9A001105
- Number of cells of square lattice of edge 1/n inside quadrant of unit circle centered at 0.at n=14A001182
- a(n) = floor(n*log((14/11)*n^(10/9))).at n=37A001195
- Continued fraction for e^2.at n=65A001204
- a(n) is the solution to the postage stamp problem with n denominations and 4 stamps.at n=6A001214
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25 cents.at n=36A001301
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25, 50 cents.at n=36A001302