13279
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
- 5
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 15504
- Proper Divisor Sum (Aliquot Sum)
- 2225
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11340
- Möbius Function
- 0
- Radical
- 1897
- Omega Function (Ω)
- 3
- 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
- 76
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- Squarefree Number
- no
- 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
- T(n,n-4), array T as in A038792.at n=24A038794
- One seventh of the sum of the first n primes, when an integer.at n=26A112272
- a(n) = the smallest positive integer m with exactly n (no more, no fewer) distinct primes represented in binary as substrings within the binary representation of m.at n=24A146526
- Number of partitions of n containing at least one part m-4 if m is the largest part.at n=37A212544
- Number of odd squarefree numbers <= 2^n.at n=15A256942
- Numbers n such that the average of the positive divisors of n is a Fibonacci number.at n=35A272440
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 806", based on the 5-celled von Neumann neighborhood.at n=38A273608
- Numbers k such that 3*10^k - 49 is prime.at n=25A274037
- Number of n X n 0..1 arrays with every element unequal to 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=4A304150
- Number of nX5 0..1 arrays with every element unequal to 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=4A304153
- T(n,k)=Number of nXk 0..1 arrays with every element unequal to 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=40A304156
- a(n) is the smallest k such that A307092(k) = n.at n=22A307074
- Positions of first appearances in A124771 = number of distinct contiguous subsequences of compositions in standard order.at n=49A335279
- Index of n-th prime in A386482, or -1 if that prime is missing.at n=54A386483
- a(n) is the index where A387090(n) appears in A386482.at n=25A386484