13064
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 16
- Divisor Sum
- 25920
- Proper Divisor Sum (Aliquot Sum)
- 12856
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6160
- Möbius Function
- 0
- Radical
- 3266
- Omega Function (Ω)
- 5
- 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
- 138
- 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
- yes
- Odd
- no
Appears in sequences
- Fibonacci sequence beginning 2, 12.at n=16A022368
- Gilda's numbers: numbers k such that if a Fibonacci sequence is formed with first term = a certain absolute value between decimal digits in k (A007953) and second term = sum of decimal digits in k (A040997), then k itself occurs as a term in the sequence.at n=21A042947
- Difference between larger and smaller terms of n-th amicable pair.at n=8A066539
- Number of 3-step self-avoiding walks on an n X n square summed over all starting positions.at n=33A188148
- Number of 1:4:sqrt(17) proportioned triangles on a (n+1) X (n+1) grid.at n=17A189884
- Numbers k such that 3^k + 32 is prime.at n=23A219048
- Number of length n+3 0..7 arrays with some pair in every consecutive four terms totalling exactly 7.at n=1A245949
- T(n,k)=Number of length n+3 0..k arrays with some pair in every consecutive four terms totalling exactly k.at n=29A245950
- Number of length 2+3 0..n arrays with some pair in every consecutive four terms totalling exactly n.at n=6A245952
- Number of length n+2 0..7 arrays with no pair in any consecutive three terms totalling exactly 7.at n=2A245994
- T(n,k)=Number of length n+2 0..k arrays with no pair in any consecutive three terms totalling exactly k.at n=38A245995
- Number of length 3+2 0..n arrays with no pair in any consecutive three terms totalling exactly n.at n=6A245998
- Numbers n such that 1+16n^2, 1+16(n+1)^2 and 1+16(n+2)^2 are prime.at n=40A255635
- Number T(n,k) of compositions of n where each part i is marked with a word of length i over a k-ary alphabet whose letters appear in alphabetical order and all k letters occur at least once in the composition; triangle T(n,k), n >= 0, 0 <= k <= n, read by rows.at n=25A261781
- Numbers k such that k and k+1 both have 16 divisors.at n=31A274359
- Number of set partitions of [n] such that six is a multiple of each block size.at n=9A275424
- Difference between the larger and smaller terms of the n-th amicable pair (x,y) given in A259933.at n=10A275469
- Number of compositions of n where each part i is marked with a word of length i over a quaternary alphabet whose letters appear in alphabetical order and all four letters occur at least once in the composition.at n=2A293581
- Numbers k, the smallest of at least 4 consecutive numbers x, for which phi(x) <= phi(x+1).at n=40A295865
- Anagrasum integers: integers N that exactly reproduce their set of digits when we form the set of sums of pairs of adjacent digits.at n=29A296521