44
domain: N
Properties
Digital Properties
- Digit Count
- 2
- Digit Sum
- 8
- Digital Root
- 8
- Palindromic Number
- yes
- Repdigit
- yes
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 84
- Proper Divisor Sum (Aliquot Sum)
- 40
- 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
- 20
- Möbius Function
- 0
- Radical
- 22
- Omega Function (Ω)
- 3
- Little Omega Function (ω)
- 2
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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 16
- Smith Number
- no
Classification
- Natural
- yes
- Even
- yes
- Odd
- 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
- no
- Carmichael Number
- no
Names
- German
- vierundvierzig· ordinal: vierundvierzigste
- English
- forty-four· ordinal: forty-fourth
- Spanish
- cuarenta y cuatro· ordinal: 44º
- French
- quarante-quatre· ordinal: quarante-quatrième
- Italian
- quarantaquattro· ordinal: 44º
- Latin
- quadraginta quattuor· ordinal: 44.
- Portuguese
- quarenta e quatro· ordinal: 44º
Appears in sequences
- Euler totient function phi(n): count numbers <= n and prime to n.at n=68A000010
- Number of n-bead necklaces (turning over is allowed) where complements are equivalent.at n=10A000011
- Number of positive integers <= 2^n of form x^2 + 16*y^2.at n=8A000018
- Mosaic numbers or multiplicative projection of n: if n = Product (p_j^k_j) then a(n) = Product (p_j * k_j).at n=43A000026
- The positive integers. Also called the natural numbers, the whole numbers or the counting numbers, but these terms are ambiguous.at n=43A000027
- Numbers that are not squares (or, the nonsquares).at n=37A000037
- 1-digit numbers arranged in alphabetical order, then the 2-digit numbers arranged in alphabetical order, then the 3-digit numbers, etc.at n=36A000052
- Numbers k such that (2k)^4 + 1 is prime.at n=15A000059
- A Beatty sequence: a(n) = floor(n/(e-2)).at n=31A000062
- Odious numbers: numbers with an odd number of 1's in their binary expansion.at n=22A000069
- 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=9A000073
- a(n) = n*(n+3)/2.at n=8A000096
- Number of transformation groups of order n.at n=42A000113
- Number of even sequences with period 2n (bisection of A000011).at n=5A000117
- Nearest integer to modified Bessel function K_n(1).at n=4A000155
- Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.at n=5A000166
- a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n).at n=42A000203
- A Beatty sequence: floor(n*(e-1)).at n=25A000210
- Number of n-node unlabeled connected graphs with one cycle of length 3.at n=5A000226
- Maximum m such that there are no two adjacent elements belonging to the same n-th power residue class modulo some prime p in the sequence 1,2,...,m (equivalently, there is no n-th power residue modulo p in the sequence 1/2,2/3,...,(m-1)/m).at n=3A000236