1441
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 10
- Digital Root
- 1
- Palindromic Number
- yes
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 1584
- Proper Divisor Sum (Aliquot Sum)
- 143
- 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
- 1300
- Möbius Function
- 1
- Radical
- 1441
- Omega Function (Ω)
- 2
- 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
- no
- Pronic Number
- no
Recreational
- Happy Number
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 140
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- Squarefree Number
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Genus of modular group Gamma(n) = genus of modular curve Chi(n).at n=36A001767
- Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.at n=15A003154
- a(n) = (5^n - 3^n)/2.at n=5A005059
- a(n+1) = a(n)-th composite number, with a(0) = 1.at n=20A006508
- Coordination sequence T2 for Zeolite Code AEL.at n=25A008005
- Coordination sequence T5 for Zeolite Code -CLO.at n=34A009854
- a(n) = 11 a(n-1) + 5 a(n-2).at n=4A015597
- Positive integers n such that 2^n == 2^11 (mod n).at n=33A015935
- Sum of gcd(x, y) for 1 <= x, y <= n.at n=24A018806
- Values of n for which exp(Pi*sqrt(n)) is very close to an integer.at n=50A019296
- Ceiling of Gamma(n+7/12)/Gamma(7/12).at n=7A020092
- Pseudoprimes to base 42.at n=7A020170
- Pseudoprimes to base 53.at n=22A020181
- Pseudoprimes to base 58.at n=12A020186
- Pseudoprimes to base 61.at n=25A020189
- Pseudoprimes to base 70.at n=11A020198
- Pseudoprimes to base 73.at n=26A020201
- Pseudoprimes to base 78.at n=10A020206
- Pseudoprimes to base 89.at n=26A020217
- Strong pseudoprimes to base 53.at n=4A020279