5044
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
- 1
Divisibility
- Divisor Count
- 12
- Divisor Sum
- 9604
- Proper Divisor Sum (Aliquot Sum)
- 4560
- 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
- 2304
- Möbius Function
- 0
- Radical
- 2522
- 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
- 41
- Smith Number
- no
- Vampire 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
Appears in sequences
- Number of ways of writing 0 as Sum_{k=-n..n} e(k)*k, where e(k) is 0 or 1.at n=8A000980
- a(n) = floor(1000*log_2(n)).at n=32A004265
- a(n) = round(1000*log_2(n)).at n=32A004266
- Coordination sequence T2 for Zeolite Code MEP.at n=42A008158
- Coordination sequence T6 for Zeolite Code MFS.at n=44A008178
- Coordination sequence T2 for Zeolite Code NON.at n=43A008213
- Pseudoprimes to base 61.at n=40A020189
- Numbers k such that the continued fraction for sqrt(k) has period 54.at n=23A020393
- a(0)=1, a(1)=1, a(2)=1, a(n) = 2*a(n-1) + a(n-2) + 1.at n=11A033539
- Number of partitions satisfying cn(2,5) <= cn(1,5) + cn(4,5) and cn(3,5) <= cn(1,5) + cn(4,5).at n=30A039891
- Numerators of continued fraction convergents to sqrt(103).at n=7A041184
- Numbers n such that lcm(sigma(n),phi(n)) is a perfect square.at n=33A043293
- Third spoke of a hexagonal spiral.at n=41A056107
- Numbers k such that phi(k) and sigma(k) are both perfect squares.at n=4A067781
- a(n) = 6*a(n-1) - a(n-2) + 2, with a(0)=1, a(1)=4.at n=5A072221
- Numbers n such that phi(n+1) = reverse(phi(n)).at n=5A074241
- Smallest even number such that n even numbers beginning with it are not squarefree.at n=8A075382
- Smallest even number such that n even numbers beginning with it are not squarefree.at n=7A075382
- Smallest even number such that n even numbers beginning with it are not squarefree.at n=6A075382
- Smallest even number such that n even numbers beginning with it are not squarefree.at n=5A075382