12423
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 12
- Digital Root
- 3
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17136
- Proper Divisor Sum (Aliquot Sum)
- 4713
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8000
- Möbius Function
- -1
- Radical
- 12423
- 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
- 94
- 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 compositions into sums of cubes.at n=49A023358
- Numbers having four 3's in base 6.at n=34A043384
- Semiperimeter of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=15A089549
- a(n) is the smallest value for which a(n), a(n)+1, ..., a(n)+n-1 are all lengths of hypotenuses of Pythagorean triangles.at n=14A098993
- a(n) = least integer that begins a run of exactly n consecutive integers that can be the hypotenuse of a Pythagorean triangle.at n=14A099799
- Numbers k such that the k-th triangular number contains only digits {1,6,7}.at n=14A119141
- Number of 1-2-3 trees with n edges and with thinning limbs.at n=12A124497
- 3 times heptagonal numbers: a(n) = 3*n*(5*n-3)/2.at n=41A152773
- Number of n X n symmetric binary matrices with each 1 adjacent to exactly 1 diagonally or antidiagonally neighboring 1.at n=6A191273
- Numbers n such that 10^n - 1 divides 10^(10^100) - 10.at n=35A200879
- Number of length n+2 0..1 arrays with at most one downstep in every n consecutive neighbor pairs.at n=39A255993
- a(n) = number of steps to reach 0 when starting from k = (n^3)-1 and repeatedly applying the map that replaces k with k - A055401(k), where A055401(k) = the number of positive cubes needed to sum to k using the greedy algorithm.at n=46A261228
- Number of n X n 0..2 arrays with no element equal to any value at offset (-2,-2), (-1,0) or (-1,1) and new values introduced in order 0..2.at n=4A275125
- Number of nX5 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=4A275128
- T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=40A275131
- Number of 5Xn 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=4A275134
- Number of subsets of {1..n} whose elements have the same number of prime factors, counted with multiplicity.at n=37A339511
- Number of compositions (ordered partitions) of n into two or more cubes.at n=49A348524
- a(n) = Sum_{k=0..floor(n/3)} (-1)^k * binomial(2*n-5*k,n-3*k).at n=8A360212