444
domain: N
Properties
Digital Properties
- Digit Count
- 3
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- yes
- Repdigit
- yes
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 1064
- Proper Divisor Sum (Aliquot Sum)
- 620
- 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
- 144
- Möbius Function
- 0
- Radical
- 222
- 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
- 71
- 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
- no
- Carmichael Number
- no
Classification
- Even
- yes
- Odd
- no
Names
- German
- vierhundertvierundvierzig· ordinal: vierhundertvierundvierzigste
- English
- four hundred forty-four· ordinal: four hundred forty-fourth
- Spanish
- cuatrocientos cuarenta y cuatro· ordinal: 444º
- French
- quatre cent quarante-quatre· ordinal: quatre cent quarante-quatrième
- Italian
- quattrocentoquarantaquattro· ordinal: 444º
- Latin
- quadringenti quadraginta quattuor· ordinal: 444.
- Portuguese
- quatrocentos e quarenta e quatro· ordinal: 444º
Appears in sequences
- Number of twin prime pairs < square of n-th prime.at n=38A000885
- Moran numbers: k such that k/(sum of digits of k) is prime.at n=34A001101
- One-half the number of permutations of length n with exactly 3 rising or falling successions.at n=7A001267
- Numbers n such that every digit contains a loop (version 2).at n=31A001744
- a(2n) = a(2n-1) + 2a(2n-2), a(2n+1) = a(2n) + a(2n-1), with a(1) = 2 and a(2) = 3.at n=9A001882
- Palindromes in base 10.at n=53A002113
- a(n) = 4*(10^n - 1)/9.at n=3A002278
- Second-order Eulerian numbers <<n+1,n-1>>.at n=3A002538
- Expansion of 1/((1-x)^4*(1+x)).at n=15A002623
- Numbers k such that (k^2 + k + 1)/19 is prime.at n=16A002643
- Expansion of (theta_3(z)*theta_3(7z)+theta_2(z)*theta_2(7z))^3.at n=8A002653
- a(n) = 1 + Sum_{k=0..n} 2^k*k!.at n=5A004400
- a(n) = round(n*phi^5), where phi is the golden ratio, A001622.at n=40A004940
- a(n) = ceiling(n*phi^5), where phi is the golden ratio, A001622.at n=40A004960
- Start with 4; if k appears then so do 2k+2 and 3k+3. (duplicates omitted.)at n=47A005662
- Second-order Eulerian numbers <<n,3>>.at n=2A006260
- Triangular numbers plus quarter squares: n*(n+1)/2 + floor(n^2/4) (i.e., A000217(n) + A002620(n)).at n=24A006578
- Next term is uniquely the sum of 3 earlier terms.at n=34A007087
- Number of partitions of n into parts of sizes {a( )} is a(n).at n=27A007209
- Number of elements (a b, c d) in GL(2,Z) with |det| = 1, trace <= n and 0 <= a <= {b, c} <= d.at n=31A007295