13353
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17808
- Proper Divisor Sum (Aliquot Sum)
- 4455
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8900
- Möbius Function
- 1
- Radical
- 13353
- 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
- 68
- 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
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 76.at n=36A031574
- Number of partitions of n into parts not of the form 9k, 9k+4 or 9k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 3 are greater than 1.at n=45A035943
- Number of partitions satisfying cn(0,5) < cn(1,5) + cn(2,5) + cn(3,5) and cn(0,5) < cn(4,5) + cn(2,5) + cn(3,5).at n=34A039847
- A good sequence of gaps for Shellsort, found by genetic programming.at n=10A112262
- a(n) = ((6*n + 10)/27)*2^(n-1) + ((-1)^(n-1))*(6*n + 5)/27.at n=12A127976
- Compositions with superdiagonal growth: number of compositions (p0, p1, p2, ...) of n with pi - p0 >= i.at n=37A238861
- Least positive integer k such that k^3 + (k+1)^3 + ... + (k+n-2)^3 + (k+n-1)^3 is the sum of two positive cubes. a(n) = 0 if no solution exists.at n=46A273877
- Integers that concatenate 3 counts: the number of terms in the sequence so far, the number of primes in the sequence so far, the number of digits in the sequence so far, with a(1)= 113. The sequence is always extended with the smallest available integer not leading to a contradiction or a dead end.at n=12A309617