12309
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
- 1
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 17952
- Proper Divisor Sum (Aliquot Sum)
- 5643
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 7440
- Möbius Function
- -1
- Radical
- 12309
- 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
- 37
- 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
- -1 + number of partitions of n.at n=34A000065
- a(n) = a(n-1) + a(n-2) + 1, with a(0)=3, a(1)=9.at n=16A022408
- Expansion of 1/((1-3x)(1-8x)(1-10x)(1-12x)).at n=3A028103
- a(n) = a(n-2) + a(n-3) + 2*a(n-4), with a(1) = 0, a(2) = 2, a(3) = 3, a(4) = 10.at n=20A175899
- Potential magic constants of 9 X 9 magic squares composed of consecutive primes.at n=19A191679
- Number of binary strings of length n+7 such that the smallest number whose binary representation is not visible in the string is 9.at n=9A261474
- Number of integers in n-th generation of tree T(-5/2) defined in Comments.at n=25A274155
- Numbers b_n of Fibonacci-quilt legal decompositions of n.at n=33A289432
- Number of permutations of [n] avoiding {1342, 2314, 4231}.at n=9A294816
- On a diagonally numbered square grid, with labels starting at 1, this is the number of steps that a (1,n) leaper makes before getting trapped when moving to the lowest available unvisited square, or -1 if it never gets trapped.at n=42A352730
- Number of integer partitions of n not forming an arithmetic progression with offset 0.at n=34A389920