167
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 168
- Proper Divisor Sum (Aliquot Sum)
- 1
- 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
- 166
- Möbius Function
- -1
- Radical
- 167
- Omega Function (Ω)
- 1
- Little Omega Function (ω)
- 1
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 67
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- yes
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 39
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshundertsiebenundsechzig· ordinal: einshundertsiebenundsechzigste
- English
- one hundred sixty-seven· ordinal: one hundred sixty-seventh
- Spanish
- ciento sesenta y siete· ordinal: 167º
- French
- cent soixante-sept· ordinal: cent soixante-septième
- Italian
- centosessantasette· ordinal: 167º
- Latin
- centum sexaginta septem· ordinal: 167.
- Portuguese
- cento e sessenta e sete· ordinal: 167º
Appears in sequences
- Primes that divide at least one term in every Fibonacci sequence.at n=10A000057
- Numbers k such that (2k)^4 + 1 is prime.at n=46A000059
- Number of trees of diameter 6.at n=5A000251
- Primes p == 7, 19, 23 (mod 40) such that (p-1)/2 is also prime.at n=4A000353
- Primes and squares of primes.at n=43A000430
- Number of different score sequences that are possible in an n-team round-robin tournament.at n=8A000571
- A Beatty sequence: [ n(e+1) ].at n=44A000572
- n-th superior highly composite number A002201(n) is product of first n terms of this sequence.at n=61A000705
- Number of partitions of n, with two kinds of 1, 2, 3 and 4.at n=8A000710
- Total number of 1's in binary expansions of 0, ..., n.at n=58A000788
- Number of partitions of n into relatively prime parts. Also aperiodic partitions.at n=15A000837
- Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).at n=52A000961
- n! never ends in this many 0's.at n=32A000966
- Wagstaff numbers: numbers k such that (2^k + 1)/3 is prime.at n=14A000978
- Related to S(n), the number of self-dual monotone Boolean functions of n variables (A001206): 2^n-th term is S(n).at n=19A001087
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=37A001092
- Primes with 5 as smallest primitive root.at n=6A001124
- Primes == +-1 (mod 8).at n=16A001132
- Partial sums of A001462; also a(n) is the last occurrence of n in A001462.at n=27A001463
- Full reptend primes: primes with primitive root 10.at n=13A001913