12035
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 11
- Digital Root
- 2
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 15120
- Proper Divisor Sum (Aliquot Sum)
- 3085
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 9184
- Möbius Function
- -1
- Radical
- 12035
- Omega Function (Ω)
- 3
- 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
- 187
- Smith Number
- no
- Vampire Number
- no
Primality
- Prime
- no
- Composite Number
- yes
- Semiprime
- no
- 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
- Number of partitions of n with equal number of parts congruent to each of 0 and 1 (mod 4).at n=48A035540
- a(n+1) = a(n) converted to base 10 from base 15.at n=12A055986
- Numbers k such that sigma(k) divides sigma(k+1), where sigma(k) is sum of positive divisors of k.at n=20A058072
- Numbers k such that gcd(sigma(k), sigma(k+1)) > k.at n=32A066025
- Numbers k such that product of factorials of digits of k equals pi(k) (A000720).at n=5A066457
- Numbers k such that (k, sigma(k)) lies on a circle with integral radius centered at the origin, i.e., k^2 + sigma(k)^2 is a square.at n=19A066764
- Numbers k such that sigma(k+1) = 2*sigma(k).at n=7A067081
- Numbers k such that the largest prime factor of k is equal to the sum of primes dividing k+1 (with repetition).at n=15A071861
- sigma(n) plus the n-th prime gives a square.at n=42A114082
- 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), (-1, 1, 1), (0, 1, 1), (1, 0, 0)}.at n=8A149995
- Number of ways to place zero or more nonadjacent 0,0 1,0 2,1 2,2 3,0 3,1 4,0 4,2 polyhexes in any orientation on a planar nXnXn triangular grid.at n=8A155404
- Inverse Euler transform of A156305.at n=7A158267
- Triangle, read by rows, that transforms diagonals in the array A158825 of coefficients of successive iterations of x*C(x) where C(x) is the Catalan function (A000108).at n=40A158835
- Union of A071863 and A071861.at n=43A193458
- Values of x in A216363.at n=21A216382
- Number of arrays of median of three adjacent elements of some length-5 0..n array, with no adjacent equal elements in the latter.at n=21A229013
- Products of 3 evil primes (A027699) p,q,r, such that numbers p*q, p*r, q*r, and p*q*r are odious (A000069).at n=16A230353
- Number of distinct pairs (m, y), where m >= 1 and y is an integer partition of n with no 1's, such that m can be obtained by iteratively adding or multiplying together parts of y until only one part (equal to m) remains.at n=19A319911
- E.g.f.: exp(1 / (1 - arctan(x)) - 1).at n=7A331617
- Number of lattice paths from (0,0) to (n,0) that do not go below the x-axis, and at (x,y) only allow steps (1,v) with v in {-1,0,1,...,y+1}.at n=11A333069