150
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 6
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 372
- Proper Divisor Sum (Aliquot Sum)
- 222
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Highly Composite
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 40
- Möbius Function
- 0
- Radical
- 30
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 3
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
- 15
- 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
- einshundertfünfzig· ordinal: einshundertfünfzigste
- English
- one hundred fifty· ordinal: one hundred fiftieth
- Spanish
- ciento cincuenta· ordinal: 150º
- French
- cent cinquante· ordinal: cent cinquantième
- Italian
- centocinquanta· ordinal: 150º
- Latin
- centum quinquaginta· ordinal: 150.
- Portuguese
- cento e cinquenta· ordinal: 150º
Appears in sequences
- Number of ways of making change for n cents using coins of 1, 2, 5, 10 cents.at n=36A000008
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=47A000134
- Crossing number of complete graph with n nodes.at n=12A000241
- One half of the number of permutations of [n] such that the differences have 4 runs with the same signs.at n=1A000486
- Number of necklaces of partitions of n+1 labeled beads.at n=4A000629
- a(n) = E(n+1) - 2*E(n), where E(i) is the Euler number A000111(i).at n=6A000708
- Numbers that are divisible by at least three different primes.at n=18A000977
- Numbers k such that k / (sum of digits of k) is a square.at n=16A001102
- a(n) = 3^n - 3*2^n + 3.at n=5A001117
- Continued fraction for e^2.at n=60A001204
- Smallest k such that the product of q/(q-1) over the primes from prime(n) to prime(n+k-1) is greater than 2.at n=9A001276
- Triangle read by rows, in which row n consists of n(n+m) for m = 1 .. n-1.at n=40A001283
- Numbers of form m*k with m+1 <= k <= 2m-1.at n=40A001284
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 50, 100 cents.at n=36A001312
- Number of partitions of n into at most 4 parts.at n=23A001400
- Number of n-step self-avoiding walks on cubic lattice.at n=3A001412
- Expansion of (Product_{j>=1} (1-(-x)^j) - 1)^5 in powers of x.at n=38A001483
- Winning moves in Fibonacci nim.at n=27A001581
- Number of one-sided triangulations of the disk; or flexagons of order n; or unlabeled plane trivalent trees (n-2 internal vertices, all of degree 3 and hence n leaves).at n=8A001683
- Number of irreducible polynomials of degree n over GF(5); dimensions of free Lie algebras.at n=4A001692