13369
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 22
- Digital Root
- 4
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 4
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13860
- Proper Divisor Sum (Aliquot Sum)
- 491
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12880
- Möbius Function
- 1
- Radical
- 13369
- 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
- 94
- Smith Number
- yes
- 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 period 89.at n=13A020428
- a(n) = (d(n) - r(n))/5, where d = A026037 and r is the periodic sequence with fundamental period (1,2,0,2,0).at n=56A026039
- a(n) = (1+(A034939(n))^2)/5^n.at n=7A199206
- a(n) = (A048899(n)^2 + 1)/5^n, n >= 0.at n=7A210849
- Numbers which are the sum of their proper divisors and their anti-divisors.at n=8A219053
- Numbers n>1 that divide the sum of their divisors and anti-divisors.at n=18A240746
- Norm of the complex coefficients in 1/(1 - x + (1-2*I)*x^2).at n=9A249582
- Zeroless numbers n with digits d_1, d_2, ... d_k such that d_1^3 + ... + d_k^3 is a cube.at n=45A254960
- Numbers k such that k!4 + 2^10 is prime, where k!4 = k!!!! is the quadruple factorial number (A007662).at n=28A291351
- Solution of the complementary equation a(n) = 2*a(n-1) + a(n-2) + b(n-2), where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=10A295142
- Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A299676
- Number of nX5 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A299679
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=40A299682
- Odd composite integers m such that A087130(m) == 5 (mod m).at n=24A335671
- Numbers k of the form (x + y)*(x^2 + y^2) such that (x + y) and (x^2 + y^2) are primes.at n=26A349202