13246
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 20520
- Proper Divisor Sum (Aliquot Sum)
- 7274
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6408
- Möbius Function
- -1
- Radical
- 13246
- 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
- no
- Harshad Number
- no
- Narcissistic Number
- no
- Collatz Steps
- 169
- 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
- yes
- Odd
- no
Appears in sequences
- Numbers k such that k^256 + 1 is prime.at n=35A056995
- Numbers k such that numerator(Bernoulli(2*k)/(2*k)) is different from numerator(Bernoulli(2*k)/(2*k*(2*k-1))).at n=51A090495
- Column 3 of triangle A091602.at n=42A091606
- Fibonacci-Collatz sequence: a(1)=1, a(2)=2; for n > 2, let fib = a(n-1) + a(n-2); if fib is odd then a(n) = 3*fib + 1 else a(n) = fib/2.at n=12A105801
- a(n) = numerator of constant lambda(n) involved in a recurrence for the Atkin polynomials A_k(j).at n=30A145226
- Numbers n with property that n^2 is a sum of some 70 successive primes.at n=18A166256
- Number of n X 3 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=4A183486
- Number of nX5 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=2A183488
- T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=23A183492
- T(n,k)=Number of nXk 0..3 arrays with every element equal to either the sum mod 4 of its vertical neighbors or the sum mod 4 of its horizontal neighbors.at n=25A183492
- Number of n X 3 arrays with each row a permutation of 1..3 having at least as many downsteps as the preceding row, with rows in lexicographically nonincreasing order.at n=40A222001
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 78", based on the 5-celled von Neumann neighborhood.at n=36A270093
- Hexagon-rooted catafusenes (see Cyvin et al. for precise definition).at n=9A323919