5353
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
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 5508
- Proper Divisor Sum (Aliquot Sum)
- 155
- 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
- 5200
- Möbius Function
- 1
- Radical
- 5353
- 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
- yes
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 46
- 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
- Number of ordered 5-tuples of integers from [ 2,n ] with no common factors among triples.at n=16A015657
- Add 1, multiply by 1, add 2, multiply by 2, etc., start with 2.at n=13A019460
- a(n) = T(2*n+1, n+3), T given by A026998.at n=4A027006
- a(n) = greatest number in row n of array T given by A026998.at n=13A027008
- a(n) = T(n, 2*n-8), T given by A027960.at n=9A027970
- a(n) = greatest number in row n of array T given by A027960.at n=13A027977
- Least term in period of continued fraction for sqrt(n) is 6.at n=28A031430
- Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 11.at n=5A031599
- Number of partitions of n into parts not of form 4k+2, 20k, 20k+3 or 20k-3. Also number of partitions in which no odd part is repeated, with 1 part of size less than or equal to 2 and where differences between parts at distance 4 are greater than 1 when the smallest part is odd and greater than 2 when the smallest part is even.at n=48A036025
- Partial sums of A027964.at n=8A053298
- (n - phi(n)) | sigma(n) for composite n not congruent to 2 (mod 4).at n=16A055164
- Integer part of log(n!)^sqrt(n).at n=10A062453
- Numbers k such that prime(k+3)-(k+3)*tau(k+3) = prime(k-3)-(k-3)*tau(k-3) where tau(k) = A000005(k) is the number of divisors of k.at n=15A067355
- Smallest argument m such that commutator[phi(m), gpf(m)] = 2n-1, where phi(m) = A000010(m) and gpf(m) = A006530(m), the largest prime factor of m.at n=43A070818
- a(n) is the smallest index m such that Sum_{k=2..m} 1/PrimePi(k) >= n, where PrimePi()=A000720().at n=32A074633
- Numbers n such that 3^n-2^(n-1) is prime.at n=26A095906
- a(n) = floor(Pi^(n/2)).at n=15A102475
- Numbers n such that digits of n are not present in n^4.at n=53A111116
- Numbers k such that the continued fraction of (1 + sqrt(k))/2 has period 7.at n=36A146332
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (0, 1, -1), (0, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=7A150217