13356
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 18
- Digital Root
- 9
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 39312
- Proper Divisor Sum (Aliquot Sum)
- 25956
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 3744
- Möbius Function
- 0
- Radical
- 2226
- Omega Function (Ω)
- 6
- Little Omega Function (ω)
- 4
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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 94
- 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
- Total number of fixed points in rooted trees with n nodes.at n=10A005200
- Table related to labeled rooted trees, cycles and binary trees.at n=23A054589
- Numbers n such that n | sigma_13(n).at n=25A055717
- a(n) = (n^3 + 24*n^2 + 65*n + 36)/6.at n=36A087863
- Number of different squares of labeled mappings of a finite set of n elements into itself.at n=6A102687
- a(n) is the number of distinct n-th powers of functions {1, 2, 3, 4, 5, 6} -> {1, 2, 3, 4, 5, 6}.at n=2A103950
- Starting with 1, each number is the previous number plus the product of the index number and the sum of the digits of the previous number.at n=39A113904
- Y values of the complete set of 23 integer solutions to the Ochoa curve equation.at n=2A141145
- Third column of A155092.at n=15A155099
- a(n) = 361*n - 1.at n=36A158308
- Numbers n such that n^6 + 545 is prime.at n=6A163592
- G.f. satisfies: A(x) = A(x^2)^3 + x*A(x^2)^2.at n=29A195200
- Tropical version of the degree-6 recurrence x(n+6)*x(n) = (x(n+5)*x(n+1))^2 + x(n+4)^2*x(n+3)^4*x(n+2)^2.at n=19A220839
- Number A(n,k) of endofunctions on [n] that are the k-th power of an endofunction; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=42A247026
- Integers that are Rhonda numbers to base 30.at n=15A255736
- Number of active (ON, black) cells at stage 2^n-1 of the two-dimensional cellular automaton defined by "Rule 491", based on the 5-celled von Neumann neighborhood.at n=6A272540
- Number of nX3 0..1 arrays with every element equal to 0, 1, 2 or 4 king-move adjacent elements, with upper left element zero.at n=16A297884
- Number of integer partitions whose sum of primes of parts equals their sum of parts plus n.at n=36A331387
- Triangle read by rows: T(n,m) = Sum_{i=1..n} C(n,i-m)*C(n+m-i,i-1)*C(n+m-i,m)/n, with T(0,0)=1.at n=61A337991
- Number of ways to write n as an ordered sum of nine powers of 2.at n=20A342252