12623
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 14
- Digital Root
- 5
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 3
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13608
- Proper Divisor Sum (Aliquot Sum)
- 985
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 11640
- Möbius Function
- 1
- Radical
- 12623
- 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
- 107
- 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
- Trajectory of 3 under map n->27n+1 if n odd, n->n/2 if n even.at n=11A037111
- Indices of primes in sequence defined by A(0) = 77, A(n) = 10*A(n-1) - 3 for n > 0. Numbers n such that (690*10^n + 3)/9 is prime.at n=8A056260
- Number of (w,x,y,z) with all terms in {1,...,n} and 2*w*x<3*y*z.at n=12A211920
- Number of binary words on {H,T} that end in THTH but do not contain the contiguous subsequence HTHH.at n=20A238644
- a(n) = the unique number k such that T(p + n) == k mod p for all primes p, where T(n) = A000798(n) = number of topologies on n points.at n=4A265042
- Number of nX4 0..1 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.at n=5A267640
- Number of nX6 0..1 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.at n=3A267642
- T(n,k)=Number of nXk 0..1 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.at n=39A267644
- T(n,k)=Number of nXk 0..1 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order.at n=41A267644
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 189", based on the 5-celled von Neumann neighborhood.at n=25A270679
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 307", based on the 5-celled von Neumann neighborhood.at n=26A271166
- Expansion of Product_{r = 1 or not a perfect power} 1/(1 - x^r).at n=41A305630
- Numbers whose sum of prime factors is equal to their product of prime indices.at n=34A331384
- a(n) = (7*floor(a(n-1)/3)) + (a(n-1) mod 3) with a(1) = 3.at n=10A338852
- a(n) = Sum_{k=1..n} floor(n/(2*k-1))^3.at n=22A350144
- Number of maximal matchings in the n-triangular honeycomb obtuse knight graph.at n=5A375419