12339
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
- 8
- Divisor Sum
- 18320
- Proper Divisor Sum (Aliquot Sum)
- 5981
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 8208
- Möbius Function
- 0
- Radical
- 1371
- Omega Function (Ω)
- 4
- 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
- 112
- 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
- Molien series for complete weight enumerator of self-dual code over GF(5) containing all-1's vector.at n=17A028345
- Number of partitions of n with equal nonzero number of parts congruent to each of 1 and 2 (mod 3).at n=42A035539
- A035539 with periodic zeros stripped.at n=13A035593
- Numbers whose base-4 representation contains exactly four 0's and three 3's.at n=1A045084
- Positions of records in the continued fraction expansion A100864.at n=15A100866
- Sum of first 2n primes.at n=37A109722
- a(n) = ceiling(Sum_{i=1..n-1} a(i)/4) for n >= 2 starting with a(1) = 1.at n=45A120160
- Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, 0, 1), (1, 1, -1), (1, 1, 0)}.at n=7A150785
- a(n) is the number of ways to insert single pairs of parenthesis to completely separate n identical objects in a straight line such that at least one of the objects at the two ends is not enclosed.at n=8A157418
- Number of n X 3 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nonincreasing order.at n=39A166830
- Partial sums of A045699.at n=36A178494
- 1/6 the number of (n+2) X 3 0..2 arrays with each 3 X 3 subblock containing one of one value, four of another, and four of the last.at n=3A184469
- 1/6 the number of (n+2)X6 0..2 arrays with each 3X3 subblock containing one of one value, four of another, and four of the last.at n=0A184472
- T(n,k)=1/6 the number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock containing one of one value, four of another, and four of the last.at n=6A184477
- T(n,k)=1/6 the number of (n+2)X(k+2) 0..2 arrays with each 3X3 subblock containing one of one value, four of another, and four of the last.at n=9A184477
- Sum of primes below Fibonacci(n).at n=14A211548
- Numbers of the form 123...n - (n+1).at n=3A234964
- Terms of A007504 divisible by 3.at n=21A249679
- Coefficients in Molien series for 5-dimensional faithful representation of Horrocks-Mumford group G_{HM}.at n=34A258702
- 6*n analog to Keith numbers.at n=6A282761