151
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 152
- 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
- 150
- Möbius Function
- -1
- Radical
- 151
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 15
- Smith Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- yes
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 36
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshunderteinundfünfzig· ordinal: einshunderteinundfünfzigste
- English
- one hundred fifty-one· ordinal: one hundred fifty-first
- Spanish
- ciento cincuenta y uno· ordinal: 151º
- French
- cent cinquante et un· ordinal: cent cinquante et unième
- Italian
- centocinquantuno· ordinal: 151º
- Latin
- centum quinquaginta unus· ordinal: 151.
- Portuguese
- cento e cinquenta e um· ordinal: 151º
Appears in sequences
- Denumerants: Expansion of 1/((1-x)*(1-x^2)*(1-x^5)).at n=51A000115
- Number of positive integers <= 2^n of form x^2 + 3 y^2.at n=9A000205
- Primes and squares of primes.at n=40A000430
- Number of graphical partitions of 2n.at n=8A000569
- Number of nonnegative solutions to x^2 + y^2 + z^2 <= n.at n=34A000606
- Numbers k such that (1,k) is "good".at n=8A000696
- n-th superior highly composite number A002201(n) is product of first n terms of this sequence.at n=56A000705
- Total number of 1's in binary expansions of 0, ..., n.at n=54A000788
- Primes p of the form 3k+1 such that sum_{x=1..p} cos(2*Pi*x^3/p) < -sqrt(p).at n=2A000923
- Padovan sequence (or Padovan numbers): a(n) = a(n-2) + a(n-3) with a(0) = 1, a(1) = a(2) = 0.at n=24A000931
- Genus of complete graph on n nodes.at n=45A000933
- Lucky numbers.at n=31A000959
- Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).at n=49A000961
- Numbers m such that Sum_{k=0..m-1} exp(2*Pi*i*k^3/m) != 0.at n=41A001074
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=36A001092
- Twin primes.at n=22A001097
- Primes with 6 as smallest primitive root.at n=2A001125
- Primes == +-1 (mod 8).at n=15A001132
- Table T(n,k) in which n-th row lists prime factors of 2^n - 1 (n >= 2), with repetition.at n=30A001265
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 25 cents.at n=35A001301