12259
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 19
- Digital Root
- 1
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 8
- Divisor Sum
- 14112
- Proper Divisor Sum (Aliquot Sum)
- 1853
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 10560
- Möbius Function
- -1
- Radical
- 12259
- 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
- 50
- 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) = (n+1)*(n+3)*(n+8)/6.at n=39A000297
- Coordination sequence for sigma-CrFe, Position Xd.at n=28A009959
- Sum of (Gaussian) q-binomial coefficients for q=-2.at n=8A015152
- Expansion of Product_{m>=1} (1-m*q^m)^23.at n=5A022683
- [ exp(8/9)*n! ].at n=6A030952
- Arrange digits of cubes in ascending order.at n=28A032553
- a(n) = the smallest number m such that there are exactly n sets of consecutive primes, each of which has an arithmetic mean of m.at n=8A050237
- Numbers k such that 80*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=7A056663
- Number of two-rowed partitions of length 4.at n=29A070557
- Diagonal sums of A081130.at n=10A081197
- Numbers that reach the fixed point 89 under iteration of f(x) = reverse(x) - maxdigit(x).at n=18A097155
- Expansion of 1/sqrt(1 - 2x + 13x^2).at n=9A098333
- Triangle, read by rows, where T(n,k) = Sum_{j=0..n-k-1} C(j+k,j)*T(n-1,j+k) for n>k>=0 with T(n,n)=1.at n=57A101494
- Triangle read by rows: T(n,k) = Sum_{j=0..n} binomial(n, k+j)*2^(n-k-j).at n=48A112626
- Minimal number k such that (2k)^(2^n) + 1 is prime, but (2k)^(2^m) + 1 is composite for m < n.at n=18A122528
- a(n) = n*(n^2+4).at n=23A155965
- Multiples of 23 whose digit reversal - 1 is also a multiple of 23.at n=20A166400
- Partial sums of A048995.at n=41A174514
- Number of partitions of n containing a clique of size 6.at n=40A183563
- Triangular array: the fission of ((2x+1)^n) by (q(n,x)), where q(n,x)=x^n+x^(n-1)+...+x+1.at n=42A193860