144
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
- 15
- Divisor Sum
- 403
- Proper Divisor Sum (Aliquot Sum)
- 259
- 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
- 48
- Möbius Function
- 0
- Radical
- 6
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 2
Special
- Factorial
- no
- Catalan Number
- no
- Bell Number
- no
- Motzkin Number
- no
- Primorial
- no
Figurate Numbers
- Fibonacci Number
- yes
- Triangular Number
- no
- Perfect Square
- yes
- 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
- yes
- Achilles Number
- no
- Perfect Power
- yes
- Smooth Number
- yes
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- einshundertvierundvierzig· ordinal: einshundertvierundvierzigste
- English
- one hundred forty-four· ordinal: one hundred forty-fourth
- Spanish
- ciento cuarenta y cuatro· ordinal: 144º
- French
- cent quarante-quatre· ordinal: cent quarante-quatrième
- Italian
- centoquarantaquattro· ordinal: 144º
- Latin
- centum quadraginta quattuor· ordinal: 144.
- Portuguese
- cento e quarenta e quatro· ordinal: 144º
Appears in sequences
- Number of primitive polynomials of degree n over GF(2) (version 2).at n=11A000020
- Dying rabbits: a(0) = 1; for 1 <= n <= 12, a(n) = Fibonacci(n); for n >= 13, a(n) = a(n-1) + a(n-2) - a(n-13).at n=12A000044
- Order of the group SL(2,Z_n).at n=5A000056
- Numbers k such that (2k)^4 + 1 is prime.at n=41A000059
- Number of transformation groups of order n.at n=65A000113
- Number of cusps of principal congruence subgroup Gamma^{hat}(n).at n=15A000114
- Number of cusps of principal congruence subgroup Gamma^{hat}(n).at n=18A000114
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=10A000118
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=17A000118
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=20A000118
- Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.at n=40A000118
- Positive zeros of Bessel function of order 0 rounded to nearest integer.at n=45A000134
- Number of ways of folding a strip of n labeled stamps.at n=5A000136
- Number of discordant permutations of length n.at n=6A000183
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=65A000203
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=69A000203
- a(n) is smallest number > a(n-1) of form a(i)*a(j), i < j < n.at n=12A000423
- n followed by n^2.at n=23A000463
- Powers of ten written in base 8.at n=2A000468
- Restricted permutations.at n=7A000496