12751
domain: N
Properties
Digital Properties
- Digit Count
- 5
- Digit Sum
- 16
- Digital Root
- 7
- Palindromic Number
- no
- Repdigit
- no
- Automorphic
- no
- Kaprekar Number
- no
- Multiplicative Persistence
- 2
Divisibility
- Divisor Count
- 4
- Divisor Sum
- 13104
- Proper Divisor Sum (Aliquot Sum)
- 353
- Abundant Number
- no
- Perfect Number
- no
- Deficient Number
- yes
- Weird Number
- no
- Untouchable Number
- no
- Primitive Abundant
- no
Derived Values
- Euler's Totient
- 12400
- Möbius Function
- 1
- Radical
- 12751
- 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
- 200
- 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
- a(n) = floor(n(n-1)(n-2)(n-3)/20).at n=24A011930
- Numbers k such that the continued fraction for sqrt(k) has period 100.at n=33A020439
- Convolution of natural numbers with Beatty sequence for tau^2 A001950.at n=29A023542
- Least k such that gcd(prime(k+1)-1, prime(k)-1) = 2n.at n=22A067605
- Terms of A094302 without repetition.at n=44A094426
- Expansion of 1/(x^k*(1-x-3*x^(k+1))) for k=4.at n=20A143455
- Row sums of triangle A144334, binomial transform of [1, 2, 6, 7, 3, 0, 0, 0, ...].at n=17A144335
- Number of n X 3 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 1,3,0,4,2 for x=0,1,2,3,4.at n=8A196324
- T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 1,3,0,4,2 for x=0,1,2,3,4.at n=57A196329
- Last occurrence of n partitions in A204814.at n=19A205301
- a(n) = floor(5*prime(n)^2 / 4).at n=25A246010
- a(n) = A277715(n) / 3.at n=53A277716
- Sequence shifts left five places under Weigh transform with a(n) = signum(n) for n<5.at n=33A316077
- Centered 10-gonal numbers which are products of two primes.at n=21A367792
- Numbers k such that 32 * 3^k - 1 is prime.at n=22A387197