13341
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 17792
- Proper Divisor Sum (Aliquot Sum)
- 4451
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8892
- Möbius Function
- 1
- Radical
- 13341
- 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
- 182
- 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
- Sum{T(n-k,k)}, 0<=k<=[ n/2 ], T given by A026714.at n=17A026724
- 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=35A031574
- Positive numbers having the same set of digits in base 6 and base 10.at n=39A037437
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A127289/A127290.at n=10A127297
- G.f.: exp( Sum_{n>=1} A119616(n)*x^n/n ) where A119616(n) = (sigma(n)^2 - sigma(n,2))/2.at n=24A201825
- Numbers n such that the greatest prime divisor p of n^2+1 has the property that (p - n)^2 + 1 = p.at n=39A206246
- Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k ascents. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. An ascent is a maximal sequence of consecutive (1,1)-steps.at n=48A246186
- Least integer k such that the n-th prime of form m^2+1 divides the composite number k^2+1.at n=20A255675
- Intersection of A002061 and A016105.at n=27A370519