149
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
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 150
- 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
- 148
- Möbius Function
- -1
- Radical
- 149
- 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
- yes
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 23
- 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
- 35
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Names
- German
- einshundertneunundvierzig· ordinal: einshundertneunundvierzigste
- English
- one hundred forty-nine· ordinal: one hundred forty-ninth
- Spanish
- ciento cuarenta y nueve· ordinal: 149º
- French
- cent quarante-neuf· ordinal: cent quarante-neufième
- Italian
- centoquarantanove· ordinal: 149º
- Latin
- centum quadraginta novem· ordinal: 149.
- Portuguese
- cento e quarenta e nove· ordinal: 149º
Appears in sequences
- Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) for n >= 3 with a(0) = a(1) = 0 and a(2) = 1.at n=11A000073
- Number of integers <= 2^n of form 4 x^2 + 4 x y + 5 y^2.at n=10A000076
- Let A(n) = #{(i,j): i^2 + j^2 <= n}, V(n) = Pi*n, P(n) = A(n) - V(n); sequence gives values of n where |P(n)| sets a new record.at n=10A000099
- 3*n - 2*floor(sqrt(4*n+5)) + 5.at n=58A000277
- Number of points of norm <= n^2 in square lattice.at n=7A000328
- Numbers m such that Fibonacci(m) ends with m.at n=14A000350
- Numbers that are the sum of 2 nonzero squares.at n=51A000404
- Numbers that are the sum of 2 but no fewer nonzero squares.at n=49A000415
- Primes and squares of primes.at n=39A000430
- Number of tournaments on n nodes determined by their score vectors.at n=10A000570
- Number of ways to represent n using the binary operator a * b = 2^a + b.at n=9A000630
- n-th superior highly composite number A002201(n) is product of first n terms of this sequence.at n=55A000705
- Irregular primes: primes p such that at least one of the numerators of the Bernoulli numbers B_2, B_4, ..., B_{p-3} (A000367) is divisible by p.at n=6A000928
- Powers of primes. Alternatively, 1 and the prime powers (p^k, p prime, k >= 1).at n=48A000961
- Union of all numbers {p, q} where p and q are both primes or powers of primes and q = p+2.at n=35A001092
- Twin primes.at n=21A001097
- Primes with primitive root 2.at n=16A001122
- Number of ways of making change for n cents using coins of 1, 2, 5, 10, 20, 50 cents.at n=34A001313
- Lesser of twin primes.at n=11A001359
- Sum of rows of triangle defined in A001404.at n=6A001410