12429
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
- 3
Divisibility
- Divisor Count
- 6
- Divisor Sum
- 17966
- Proper Divisor Sum (Aliquot Sum)
- 5537
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8280
- Möbius Function
- 0
- Radical
- 4143
- Omega Function (Ω)
- 3
- 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
- 125
- 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
- no
- Odd
- yes
Appears in sequences
- Number of 8's in all partitions of n.at n=40A024792
- Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 62 ones.at n=21A031830
- a(n) = n*(2*n^2 - 3*n + 4)/3.at n=27A037235
- Numbers having four 3's in base 6.at n=35A043384
- Matrix 9th power of partition triangle A008284.at n=48A050303
- Number of bargraphs of site-perimeter n.at n=19A075126
- Numbers k such that the fractional part of (3/2)^k decreases monotonically to zero.at n=12A081464
- G.f. satisfies: A(A(x)) = A(x)/(1-x), so that the self-COMPOSE transform generates partial sums (A107098).at n=9A107097
- Numbers k such that the fractional part of (3/2)^k is less than 1/k.at n=7A153662
- Numerator of Bernoulli(n, -1/4).at n=9A157819
- Number of (n+1) X (n+1) 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=2A206269
- Number of (n+1) X 4 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=2A206272
- T(n,k) = number of (n+1) X (k+1) 0..2 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=12A206277
- Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 2 or more, starting with 0.at n=10A221516
- Numbers k such that 1.5^k is closer to an integer than 1.5^m for any 0 < m < k.at n=15A267122
- Number of cyclic compositions (necklaces of positive integers) summing to n with adjacent parts (including the last and first part) being indivisible (either way).at n=35A318730
- Numbers k in A228058 such that also A001065(k) is in A228058.at n=19A325380
- a(n) is the number of possible values of numbers of divisors of numbers k with Omega(k) = n.at n=43A355027
- G.f. A(x) satisfies A(x) = ( 1 + x*A(x)^2/(1 + x*A(x)) )^3.at n=5A378891