13056
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 15
- Digital Root
- 6
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 36
- Divisor Sum
- 36792
- Proper Divisor Sum (Aliquot Sum)
- 23736
- Abundant Number
- yes
- Perfect Number
- no
- Deficient Number
- no
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 4096
- Möbius Function
- 0
- Radical
- 102
- Omega Function (Ω)
- 10
- 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
- 32
- 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
- Number of rooted planar bridgeless cubic maps with 2n nodes.at n=6A000309
- Number of switching networks (see Harrison reference for precise definition).at n=2A000811
- 4-dimensional figurate numbers: a(n) = n*binomial(n+2, 3).at n=15A002417
- Expansion of (1-x)^(-3) * (1-x^2)^(-2).at n=30A002624
- Theta series of laminated lattice LAMBDA_14.at n=3A023937
- Numbers k such that the continued fraction for sqrt(k) has even period and if the last term of the periodic part is deleted the central term is 57.at n=26A031555
- Expansion of 1/(1-64*x)^(1/8), related to octo-factorial numbers A045755.at n=3A034977
- Number of degree-n irreducible polynomials over GF(2) with trace = 0 and subtrace = 1.at n=19A042979
- Numbers that are divisible by exactly 10 primes with multiplicity.at n=28A046314
- Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of finite order under matrix multiplication.at n=1A053170
- Number of square divisors of n!.at n=33A055993
- Expansion of ((1-x)/(1-2*x))^3.at n=10A058396
- Numbers k such that sigma (x) = k has exactly 12 solutions.at n=14A060676
- Number of routes of length 2n on the sides of an octagon from a point to opposite point.at n=8A060995
- Square table by antidiagonals of number of routes of length 2k+n on the sides of a 2n-gon from a point to its opposite point.at n=70A061897
- Numbers k such that sigma(phi(k)) is a prime.at n=31A062514
- Number of subsets of {2,...,n} such that the product of their elements is congruent to 0 (mod n+1).at n=13A064381
- Number of n step walks (each step +/-1 starting from 0) which are never more than 3 or less than -3.at n=15A068912
- Solutions to phi(gpf(x)) - gpf(phi(x)) = 14 = c are special multiples of 17, x = 17k, where greatest prime factors of factor k were observed from {2, 3, 5}, i.e., it is smaller than 17. See solutions to other even cases of c (=A070813): A007283 for 0, A070004 for 2, A070815 for 254, A070816 for 65534. Gpf = greatest prime factor.at n=32A070814
- Number of binary Lyndon words of length n with trace 0 and subtrace 0 over Z_2.at n=19A074027