4441
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 13
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 2
- Divisor Sum
- 4442
- 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
- 4440
- Möbius Function
- -1
- Radical
- 4441
- 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
- no
- Pronic Number
- no
Recreational
- Happy Number
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 183
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- yes
- Composite Number
- no
- Semiprime
- no
- Squarefree Number
- yes
- Prime Power
- yes
- Prime Factorization
- no
- Twin Prime
- no
- Mersenne Prime
- no
- Sophie Germain Prime
- no
- Safe Prime
- no
- Powerful Number
- no
- Achilles Number
- no
- Prime Index
- 603
- Perfect Power
- no
- Smooth Number
- no
- Carmichael Number
- no
Classification
- Even
- no
- Odd
- yes
Appears in sequences
- Artiads: the primes p == 1 (mod 5) for which Fibonacci((p-1)/5) is divisible by p.at n=22A001583
- Quintan primes: p = (x^5 + y^5)/(x + y).at n=10A002650
- a(n) = n^2 written backwards.at n=37A002942
- a(n+1) = 1 + a( floor(n/1) ) + a( floor(n/2) ) + ... + a( floor(n/n) ).at n=32A003318
- Fibonacci numbers written in base 7.at n=17A004690
- Primes whose reversal is a square.at n=7A007488
- 3 and -3 are both 4th powers (one implies other) mod these primes p=1 mod 8.at n=30A014755
- Coordination sequence T2 for Zeolite Code TER.at n=45A016434
- Expansion of 1/(1-x^5-x^6-x^7-x^8).at n=47A017839
- Numbers k such that the continued fraction for sqrt(k) has period 23.at n=16A020362
- Primes that contain digits 1 and 4 only.at n=3A020452
- Primes that remain prime through 2 iterations of the function f(x) = 8*x + 5.at n=33A023262
- Maximal coefficient of Product_{k<=n} (1 + x^k). Number of solutions to +- 1 +- 2 +- 3 +- ... +- n = 0 or 1.at n=18A025591
- Arrange digits of squares in descending order.at n=38A028908
- Squarefree n such that Q(sqrt(n)) has class number 5.at n=33A029705
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted then there are a pair of central terms both equal to 4.at n=34A031417
- Upper prime of a difference of 18 between consecutive primes.at n=13A031937
- Take list of squares, move left digit of each term to end of previous term.at n=39A032760
- Numbers whose set of base-10 digits is {1,4}.at n=28A032822
- Primes of form x^2+69*y^2.at n=33A033244