5605
domain: N
Properties
Digital Properties
- Digit Count
- 4
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 7200
- Proper Divisor Sum (Aliquot Sum)
- 1595
- 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
- 4176
- Möbius Function
- -1
- Radical
- 5605
- Omega Function (Ω)
- 3
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 98
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Coordination sequence T4 for Zeolite Code DAC.at n=47A008070
- Coordination sequence T4 for Zeolite Code DDR.at n=47A008074
- Pseudoprimes to base 58.at n=27A020186
- a(n) = n*(31*n + 1)/2.at n=19A022289
- a(n) = 1*prime(n) + 2*prime(n-1) + ... + k*prime(n+1-k), where k=floor((n+1)/2) and prime(n) is the n-th prime.at n=25A023870
- a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = (primes).at n=24A024867
- Expansion of Product_{m>=1} ((1+q^(2*m-1))/(1+q^(2*m)))^5.at n=26A029842
- Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) < cn(3,5).at n=70A036874
- Maximal base 7 run length is 4.at n=24A037991
- Numbers whose base-7 representation contains exactly four 2's.at n=12A043404
- a(n) = 1 + (number of partitions of n, n>0).at n=30A052810
- Numbers n such that phi(2n+1) = sigma(n).at n=30A067229
- Numbers n such that phi(3n-1) = sigma(n).at n=36A067232
- Numbers n such that sigma(n)=phi(n*bigomega(n)-1).at n=21A067877
- Numbers k such that sigma(k) = phi(k*omega(k)-1).at n=31A067878
- a(n) = Sum_{d|n} phi(d^3).at n=20A068963
- a(n) = lcm(n, R(n)) / gcd(n, R(n)), where R(n) (A004086) is the digit reversal of n.at n=58A070246
- Nonsquares which are the product of two numbers with the same digits (leading zeros are forbidden).at n=30A072443
- Non-balanced numbers in A015765.at n=25A074868
- a(n) = sum of n-th row of the triangle pertaining to A079774(n).at n=37A079776