12243
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
- 16
- Divisor Sum
- 20736
- Proper Divisor Sum (Aliquot Sum)
- 8493
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 6240
- Möbius Function
- 1
- Radical
- 12243
- Omega Function (Ω)
- 4
- Little Omega Function (ω)
- 4
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
- 174
- 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) = a(n-1) + a(n - 1 - number of even terms so far).at n=44A006336
- Numbers whose sum of divisors is a fourth power.at n=30A019422
- Molien series for full 8 X 8 Siegel modular group H_3 of order 371589120.at n=41A027633
- Expansion of Molien series for relative invariants of 8-dimensional complex Clifford group.at n=19A043330
- Numbers n such that (i) the largest prime factor of n is not a palindrome and (ii) the sum of the factorials of the digits of n is equal to the largest prime factor of n reversed.at n=10A074301
- Let f(k) denote the largest prime factor of k which is not a palindrome. Sequence gives numbers k such that the sum of the factorials of the digits of k is equal to f(k) reversed.at n=10A111185
- a(n) = ceiling( Sum_{i=1..n-1} a(i)/5 ), a(1)=1.at n=55A120170
- Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) has height 5.at n=36A152943
- Number of partitions of n into square parts.at n=33A179662
- Potential magic constants of 9 X 9 magic squares composed of consecutive primes.at n=18A191679
- Number of 12-hour periods after which the (27+n) balls of a ball clock return to their initial state.at n=57A221617
- Products p*q*r*s of distinct primes for which (p*q*r*s - 1)/2 is prime.at n=26A234498
- Numbers n such that the sum of the divisors of n equals the fourth power of the sum of the digits of n.at n=3A260598
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 139", based on the 5-celled von Neumann neighborhood.at n=26A270280
- Number of maximal irredundant sets in the n-prism graph.at n=9A291059
- a(n) is the smallest number such that there are exactly n numbers k (including a(n) itself) such that U(k) is isomorphic to U(a(n)) (or 0 if no such number exists). Here U(k) is the multiplicative group of integers modulo k.at n=23A303712
- Numbers k such that 2^k + k + 2 is prime.at n=10A309328
- Numbers n such that N = n^3 is a twin rank (A002822: 6N +- 1 are twin primes).at n=37A326234
- Sum of the largest parts of the partitions of n into 10 parts.at n=34A326598
- a(n) = A306302(n)/2.at n=19A331756