12013
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 7
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 12348
- Proper Divisor Sum (Aliquot Sum)
- 335
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11680
- Möbius Function
- 1
- Radical
- 12013
- Omega Function (Ω)
- 2
- 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
- 42
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- yes
- 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
- no
- Odd
- yes
Appears in sequences
- Powers of fourth root of 18 rounded to nearest integer.at n=13A018097
- Powers of fourth root of 18 rounded up.at n=13A018098
- Numbers k such that the continued fraction for sqrt(k) has period 93.at n=7A020432
- a(n) = T(n,2n-7), T given by A027023.at n=8A027031
- Multiplicity of highest weight (or singular) vectors associated with character chi_169 of Monster module.at n=39A034557
- Smallest denominator d such that the Sylvester expansion of n/d has n terms.at n=13A048860
- Coefficients of monic primitive irreducible polynomials over GF(4) listed in lexicographic order.at n=36A058952
- a(n) = (2*n-1)^2 + (2*n)^2.at n=38A060820
- Numbers having exactly twelve anti-divisors.at n=39A066478
- a(n) = 8*n^2 - 4*n + 1.at n=39A080856
- Third row of Pascal-(1,5,1) array A081580.at n=26A081589
- Number of partitions of n with at least one odd part.at n=34A086543
- Column k=2 sequence of array A103728.at n=35A103729
- a(n) = n^3 - 7*n + 7.at n=22A106734
- Expansion of (-1+3*x+x^2-x^3)/((x^2+4*x+1)*(x^2-2*x-1)).at n=6A111640
- Quaternary emirpimes.at n=34A114015
- a(n) = 15*n^2 + 9*n + 1.at n=28A134153
- Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1100-1111-0011 pattern in any orientation.at n=15A147465
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 1), (0, 0, -1), (1, 0, 0), (1, 1, 1)}.at n=7A150809
- Hypotenuse C of primitive Pythagorean triangles such that perimeters are Averages of twin prime pairs, q=p+1, a=q^2-p^2, c=q^2+p^2, b=2*p*q, s=a+b+c, s-+1 are primes.at n=11A155175