12435
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
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 19920
- Proper Divisor Sum (Aliquot Sum)
- 7485
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6624
- Möbius Function
- -1
- Radical
- 12435
- 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
- yes
- Narcissistic Number
- no
- Collatz Steps
- 112
- 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
- a(n) = floor(binomial(n,6)/6).at n=22A011852
- Positive numbers k such that k and 2*k are anagrams in base 6 (written in base 6).at n=5A023064
- Positive numbers k such that k and 3*k are anagrams in base 6 (written in base 6).at n=8A023065
- Decimal representation of permutations of lengths 1, 2, 3, ... arranged lexicographically.at n=35A030299
- Number of points in Z^7 of norm <= n.at n=3A055413
- Number of points in Z^n of norm <= 3.at n=7A055427
- Largest coefficient in expansion of (1 + x + x^2 + ... + x^(n-1))^5 = ((1-x^n)/(1-x))^5, i.e., the coefficient of x^floor(5*(n-1)/2) and of x^ceiling(5*(n-1)/2); also number of compositions of floor(5*(n+1)/2) into exactly 5 positive integers each no more than n.at n=12A077044
- Array read by rows in which the n-th row contains the multiples of n in increasing order using all the digits of first n numbers.at n=15A078189
- a(0)=0; a(1)=2. Slowest increasing sequence where every digit "d" has a copy of itself in a(n+d).at n=25A102150
- Permutations of 12345: Numbers having each of the decimal digits 1,...,5 exactly once, and no other digit.at n=2A178475
- Largest coefficient of (1 + x + ... + x^11)^n.at n=5A225779
- Partial sums of A253089.at n=26A255601
- Decimal representation of permutations of lengths 1, 2, 3, ... arranged first by number of inversions and then lexicographically.at n=35A268532
- Riordan array(1/(1+x), (1-sqrt(1-4*x))/(2*x)).at n=59A278072
- List of André permutations of the first kind.at n=10A278982
- Numbers m such that the decimal digits of m are exactly the same as those of all the indices corresponding to the prime factors of m.at n=12A287916
- Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 846", based on the 5-celled von Neumann neighborhood.at n=30A290554
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals: A(n,k) = [x^(n^2)] theta_3(x)^k/(1 - x), where theta_3() is the Jacobi theta function.at n=58A302997
- Number T(n,k) of proper multisets of nonempty words with a total of n letters over k-ary alphabet such that all k letters occur at least once in the multiset; triangle T(n,k), n>=2, 1<=k<=n-1, read by rows.at n=23A320264
- Number of integer solutions to (x_1)^2 + (x_2)^2 + ... + (x_7)^2 <= n.at n=9A341396